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-02 14:33:06 +00:00
parent f7198f1e89
commit e80302e2cf
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
sorts/split_workload.py
View File

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