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

Updating cheduling/split_workload.py

Browse Source 
implementing suggestion

Co-authored-by: Tianyi Zheng <tianyizheng02@gmail.com>
This commit is contained in:
Margaret 2023-07-26 17:16:36 +03:00 committed by GitHub
parent 7f73cbd3f7
commit d053352d95
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 6 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
scheduling/split_workload.py
View File

@ -41,13 +41,12 @@ def split_list(timings: list) -> tuple:
distributed_timings_1 = [arr[j] for j in indices]
distributed_timings_2 = [arr[j] for j in range(n) if j not in indices]
diff = abs(sum(distributed_timings_1) - sum(distributed_timings_2))
if diff < smallest_diff:
smallest_diff = diff
result = (
distributed_timings_1,
distributed_timings_2,
smallest_diff,
)
smallest_diff = min(smallest_diff, diff)
result = (
distributed_timings_1,
distributed_timings_2,
smallest_diff,
)
return result
try: