From 3b0407f6543c5a94d41847827daa9296df9cf50c Mon Sep 17 00:00:00 2001
From: Margaret <62753112+meg-1@users.noreply.github.com>
Date: Sat, 29 Jul 2023 15:24:19 +0300
Subject: [PATCH] following recommendations

---
 sorts/split_workload.py | 72 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 72 insertions(+)
 create mode 100644 sorts/split_workload.py

diff --git a/sorts/split_workload.py b/sorts/split_workload.py
new file mode 100644
index 000000000..4dfb68e19
--- /dev/null
+++ b/sorts/split_workload.py
@@ -0,0 +1,72 @@
+from typing import List, Tuple, Union
+
+
+def split_list(timings: List[Union[int, float, str]]) -> Tuple[List[Union[int, float]]]:
+    """
+
+    This algorithm is a brute-force search over (nearly) all 2^n
+    possible partitions and was created for educational purposes.
+    the asymptotic runtime of this code is: O(n * 2^n)
+
+    this is a case of the partition problem.
+    it accepts a multiset ( list ) of positive integers,
+    distributes them, and returns a tuple, containing two lists,
+    with minimal difference between their sums
+
+    >>> split_list([27, 21, 92, 87, 1, 32])
+    ([27, 21, 87], [92, 1, 32], 10)
+    >>> split_list([52, 385, 9956, 25, 2367, 1111, 17, 925])
+    ([9956], [52, 385, 25, 2367, 1111, 17, 925], 5074)
+    >>> split_list([12, 10, 11, 9])
+    ([10, 11], [12, 9], 0)
+    >>> split_list([-1551, 2712, 2325, 2623])
+    ([1551, 2712], [2325, 2623], 685)
+    >>> split_list(["12.5", "10", "11", "9"])
+    ([10, 11], [12.5, 9], 0.5)
+    >>> split_list(["twelve", "ten", "eleven", "nine"])
+    Traceback (most recent call last):
+    ValueError: only numbers please
+
+    """
+
+    for i, current_element in enumerate(timings):
+        if (
+            isinstance(current_element, str)
+            and current_element.replace(".", "", 1).isdigit()
+        ):
+            is_current_elem_int = float(current_element).is_integer()
+            if not is_current_elem_int:
+                timings[i] = abs(float(current_element))
+            else:
+                timings[i] = abs(int(float(current_element)))
+        elif isinstance(current_element, (int, float)):
+            timings[i] = abs(current_element)
+        else:
+            raise ValueError("only numbers please")
+
+    if len(timings) == 0:
+        return ([], [], 0)
+    elif len(timings) == 1:
+        return ([timings[0]], [], 1)
+    else:
+        result = None
+        n = len(timings)
+        smallest_diff = float("inf")
+        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]
+            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:
+                smallest_diff = diff
+                result = (
+                    distributed_timings_1,
+                    distributed_timings_2,
+                    smallest_diff,
+                )
+        return result
+
+
+if __name__ == "__main__":
+    __import__("doctest").testmod()