mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-25 10:28:39 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2023-08-09 14:10:49 +00:00
parent 6352fec07e
commit 9d77d9f917
1 changed files with 3 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
sorts/split_workload.py
View File

@ -1,7 +1,9 @@
from typing import List, Tuple, Union
def split_list(timings: list[int | float | str]) -> tuple[list[int | float], list[int | float], int | float]:
def split_list(
timings: list[int | float | str],
) -> tuple[list[int | float], list[int | float], int | float]:
"""
This algorithm is a brute-force search over (nearly) all 2^n