From 4277c8c58a676a20619a567925a205c6299d902c Mon Sep 17 00:00:00 2001 From: Margaret <62753112+meg-1@users.noreply.github.com> Date: Wed, 2 Aug 2023 17:28:08 +0300 Subject: [PATCH] Following recommendations on sorts/split_workload.py Co-authored-by: Caeden Perelli-Harris --- sorts/split_workload.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/sorts/split_workload.py b/sorts/split_workload.py index 7db54eb8e..3151cbb74 100644 --- a/sorts/split_workload.py +++ b/sorts/split_workload.py @@ -54,7 +54,7 @@ def split_list(timings: List[Union[int, float, str]]) -> Tuple[List[Union[int, f all_nums_positive = [c >= 0 for c in timings] for i in range(1, 2**n - 1): indices = [j for j in range(n) if (i & (1 << j)) != 0] - distributed_timings_1 = [timings[j] for j in indices] + indices = [j for j in range(n) if i & (1 << j) != 0] distributed_timings_2 = [timings[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: