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

Changing type hints

Browse Source
This commit is contained in:
Margaret 2023-08-09 17:09:18 +03:00 committed by GitHub
parent e80302e2cf
commit 6352fec07e
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
sorts/split_workload.py
View File

@ -1,9 +1,7 @@
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[int | float | str]) -> tuple[list[int | float], list[int | float], int | float]:
"""
This algorithm is a brute-force search over (nearly) all 2^n