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

Fixing bugs

Browse Source
This commit is contained in:
Margaret 2023-08-12 15:49:00 +03:00 committed by GitHub
parent 885e8db94a
commit 4eccaec9ff
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
sorts/split_workload.py
View File

@ -27,8 +27,8 @@ def split_list(
ValueError: Timings must be a list of numbers
"""
valid_timings = list[int | float]
for current_element in enumerate(timings):
valid_timings: list[int, float] = []
for current_element in timings:
if (
isinstance(current_element, str)
and current_element.replace(".", "", 1).isdigit()
@ -41,6 +41,7 @@ def split_list(
elif isinstance(current_element, (int, float)):
valid_timings.append(abs(current_element))
else:
print(type(current_element))
raise ValueError("Timings must be a list of numbers")
if len(valid_timings) == 0:
@ -55,7 +56,8 @@ def split_list(
indices = [j for j in range(n) if i & (1 << j) != 0]
distributed_timings_1 = [valid_timings[j] for j in indices]
distributed_timings_2 = [valid_timings[j] for j in range(n) if j not in indices]
diff = abs(sum([distributed_timings_1]) - sum(distributed_timings_2))
diff = abs(sum(distributed_timings_1) - sum(distributed_timings_2))
if diff < smallest_diff:
smallest_diff = diff
result = (