From 2bdaa3730a2c24750fb7834c4974ca7f9366d34e Mon Sep 17 00:00:00 2001
From: Bisma nadeem <130698042+Bisma-Nadeemm@users.noreply.github.com>
Date: Tue, 24 Oct 2023 10:36:09 -0700
Subject: [PATCH 1/2] Code Enhancements in merge_sort.py

This enhanced code includes improved variable naming, error handling for user input, and more detailed docstrings. It's now more robust and readable.
---
 sorts/merge_sort.py | 50 +++++++++++++++++++++++++--------------------
 1 file changed, 28 insertions(+), 22 deletions(-)

diff --git a/sorts/merge_sort.py b/sorts/merge_sort.py
index e80b1cb226ec..4fa680caa8f2 100644
--- a/sorts/merge_sort.py
+++ b/sorts/merge_sort.py
@@ -12,9 +12,13 @@
 
 def merge_sort(collection: list) -> list:
     """
-    :param collection: some mutable ordered collection with heterogeneous
-    comparable items inside
-    :return: the same collection ordered by ascending
+    Sorts a list using the merge sort algorithm.
+
+    :param collection: A mutable ordered collection with comparable items.
+    :return: The same collection ordered in ascending order.
+
+    Time Complexity: O(n log n)
+
     Examples:
     >>> merge_sort([0, 5, 3, 2, 2])
     [0, 2, 2, 3, 5]
@@ -23,34 +27,36 @@ def merge_sort(collection: list) -> list:
     >>> merge_sort([-2, -5, -45])
     [-45, -5, -2]
     """
-
+    
     def merge(left: list, right: list) -> list:
         """
-        Merge left and right.
+        Merge two sorted lists into a single sorted list.
 
-        :param left: left collection
-        :param right: right collection
-        :return: merge result
+        :param left: Left collection
+        :param right: Right collection
+        :return: Merged result
         """
-
-        def _merge():
-            while left and right:
-                yield (left if left[0] <= right[0] else right).pop(0)
-            yield from left
-            yield from right
-
-        return list(_merge())
+        result = []
+        while left and right:
+            result.append(left.pop(0) if left[0] <= right[0] else right.pop(0))
+        result.extend(left)
+        result.extend(right)
+        return result
 
     if len(collection) <= 1:
         return collection
-    mid = len(collection) // 2
-    return merge(merge_sort(collection[:mid]), merge_sort(collection[mid:]))
-
+    mid_index = len(collection) // 2
+    return merge(merge_sort(collection[:mid_index]), merge_sort(collection[mid_index:]))
 
 if __name__ == "__main__":
     import doctest
 
     doctest.testmod()
-    user_input = input("Enter numbers separated by a comma:\n").strip()
-    unsorted = [int(item) for item in user_input.split(",")]
-    print(*merge_sort(unsorted), sep=",")
+    
+    try:
+        user_input = input("Enter numbers separated by a comma:\n").strip()
+        unsorted = [int(item) for item in user_input.split(",")]
+        sorted_list = merge_sort(unsorted)
+        print(*sorted_list, sep=",")
+    except ValueError:
+        print("Invalid input. Please enter valid integers separated by commas.")

From a966bf5f9b39abc6a15075bd0f8de9a8a3d5702a Mon Sep 17 00:00:00 2001
From: "pre-commit-ci[bot]"
 <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Date: Tue, 24 Oct 2023 17:36:58 +0000
Subject: [PATCH 2/2] [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci
---
 sorts/merge_sort.py | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/sorts/merge_sort.py b/sorts/merge_sort.py
index 4fa680caa8f2..0628b848b794 100644
--- a/sorts/merge_sort.py
+++ b/sorts/merge_sort.py
@@ -27,7 +27,7 @@ def merge_sort(collection: list) -> list:
     >>> merge_sort([-2, -5, -45])
     [-45, -5, -2]
     """
-    
+
     def merge(left: list, right: list) -> list:
         """
         Merge two sorted lists into a single sorted list.
@@ -48,11 +48,12 @@ def merge(left: list, right: list) -> list:
     mid_index = len(collection) // 2
     return merge(merge_sort(collection[:mid_index]), merge_sort(collection[mid_index:]))
 
+
 if __name__ == "__main__":
     import doctest
 
     doctest.testmod()
-    
+
     try:
         user_input = input("Enter numbers separated by a comma:\n").strip()
         unsorted = [int(item) for item in user_input.split(",")]