merge sort implemented

.python-version

@@ -0,0 +1 @@
+3.13

.vscode/settings.json

@@ -0,0 +1,11 @@
+{
+    "python.testing.unittestArgs": [
+        "-v",
+        "-s",
+        ".",
+        "-p",
+        "test_*.py"
+    ],
+    "python.testing.pytestEnabled": false,
+    "python.testing.unittestEnabled": true
+}

main.py

@@ -0,0 +1,6 @@
+def main():
+    print("Hello from sort-quest!")
+
+
+if __name__ == "__main__":
+    main()

pyproject.toml

@@ -0,0 +1,9 @@
+[project]
+name = "sort-quest"
+version = "0.1.0"
+description = "Add your description here"
+readme = "README.md"
+requires-python = ">=3.13"
+dependencies = [
+    "colorful-test>=1.0.2",
+]

sort.py

@@ -12,17 +12,27 @@ class Sorter:
 
     @staticmethod
     def merge(data: List[Any], comparator: Callable[[Any, Any], bool]) -> List[Any]:
-        """
-        Sorts the list using the merge sort algorithm.
 
-        Args:
-            data (List[Any]): The list to sort.
-            comparator (Callable[[Any, Any], bool]): Comparison function.
-
-        Returns:
-            List[Any]: A new sorted list.
-        """
-        pass
+
+        if len(data) <= 1:
+            return data
+
+        mid = len(data) // 2
+        left = Sorter.merge(data[:mid], comparator)
+        right = Sorter.merge(data[mid:], comparator)
+        merged = []
+        i = 0
+        j = 0
+        while i < len(left) and j < len(right):
+            if comparator(left[i], right[j]):
+                merged.append(left[i])
+                i += 1
+            else:
+                merged.append(right[j])
+                j += 1
+        merged.extend(left[i:])
+        merged.extend(right[j:])
+        return merged
 
     @staticmethod
     def insertion(data: List[Any], comparator: Callable[[Any, Any], bool]) -> List[Any]: