912. Sort an Array.

    - Language: Python.
    - Time complexity: O(n log n).
    - Space complexity: O(3n + log n). O(log n) - for call stack.
    - Method: Recursive Merge Sort With Slices.

Author: welder87

python_solutions/lc_912_sort_an_array/__init__.py

@@ -0,0 +1,25 @@
+class Solution:
+    def sortArray(self, nums: list[int]) -> list[int]:
+        # Time complexity: O(n log n). Space complexity: O(3n).
+        # Method: Recursive Merge Sort With Slices
+        return self._merge_sort(nums)
+
+    def _merge_sort(self, nums: list[int]):
+        if len(nums) < 2:
+            return nums
+        mid = len(nums) // 2
+        ar1, ar2 = nums[:mid], nums[mid:]
+        return self._merge_two_arrays(self._merge_sort(ar1), self._merge_sort(ar2))
+
+    def _merge_two_arrays(self, ar1: list[int], ar2: list[int]) -> list[int]:
+        len1, len2 = len(ar1), len(ar2)
+        i, j = 0, 0
+        ans = [0] * (len1 + len2)
+        while i < len1 or j < len2:
+            if j == len2 or i < len1 and ar1[i] < ar2[j]:
+                ans[i + j] = ar1[i]
+                i += 1
+            else:
+                ans[i + j] = ar2[j]
+                j += 1
+        return ans

python_solutions/lc_912_sort_an_array/lc_912_sort_an_array.py

@@ -0,0 +1,29 @@
+import pytest
+
+from lc_912_sort_an_array.lc_912_sort_an_array import Solution
+
+test_cases = (
+    # preset cases
+    ([5, 2, 3, 1], [1, 2, 3, 5]),
+    ([5, 1, 1, 2, 0, 0], [0, 0, 1, 1, 2, 5]),
+    # common cases
+    ([-5, -1, 0, -1, 4, -12, 4, -1], [-12, -5, -1, -1, -1, 0, 4, 4]),
+    ([-12, -5, -1, -1, -1, 0, 4, 4], [-12, -5, -1, -1, -1, 0, 4, 4]),
+    ([4, 4, 0, -1, -1, -1, -5, -12], [-12, -5, -1, -1, -1, 0, 4, 4]),
+    ([-1, -5, -1, 0, -1, 4, -12, 4, -1], [-12, -5, -1, -1, -1, -1, 0, 4, 4]),
+    # corner cases
+    ([-1, -1, -1], [-1, -1, -1]),
+    ([], []),
+    ([0], [0]),
+    ([1, -1], [-1, 1]),
+)
+
+
+@pytest.mark.parametrize(("nums", "ans"), test_cases)
+def test_success_v0(nums: list[int], ans: list[int], solution: Solution):
+    assert solution.sortArray(nums) == ans
+
+
+@pytest.fixture
+def solution() -> Solution:
+    return Solution()