mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-23 21:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Code Enhancements in merge_sort.py (#10911)

Browse Source 
* 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.

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
Bisma nadeem 2023-10-26 02:26:54 +05:00 committed by GitHub
parent 3d0a409ce1
commit e1e5963812
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 27 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

47
sorts/merge_sort.py
View File

@ -12,9 +12,13 @@ python merge_sort.py
def merge_sort(collection: list) -> list: def merge_sort(collection: list) -> list:
""" """
:param collection: some mutable ordered collection with heterogeneous Sorts a list using the merge sort algorithm.
comparable items inside
:return: the same collection ordered by ascending :param collection: A mutable ordered collection with comparable items.
:return: The same collection ordered in ascending order.
Time Complexity: O(n log n)
Examples: Examples:
>>> merge_sort([0, 5, 3, 2, 2]) >>> merge_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5] [0, 2, 2, 3, 5]
@ -26,31 +30,34 @@ def merge_sort(collection: list) -> list:
def merge(left: list, right: list) -> list: 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 left: Left collection
:param right: right collection :param right: Right collection
:return: merge result :return: Merged result
""" """
result = []
def _merge(): while left and right:
while left and right: result.append(left.pop(0) if left[0] <= right[0] else right.pop(0))
yield (left if left[0] <= right[0] else right).pop(0) result.extend(left)
yield from left result.extend(right)
yield from right return result
return list(_merge())
if len(collection) <= 1: if len(collection) <= 1:
return collection return collection
mid = len(collection) // 2 mid_index = len(collection) // 2
return merge(merge_sort(collection[:mid]), merge_sort(collection[mid:])) return merge(merge_sort(collection[:mid_index]), merge_sort(collection[mid_index:]))
if __name__ == "__main__": if __name__ == "__main__":
import doctest import doctest
doctest.testmod() doctest.testmod()
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")] try:
print(*merge_sort(unsorted), sep=",") 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.")