mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-07 01:50:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update adaptive_merge_sort.py

Browse Source
This commit is contained in:
ANANT JAIN 2024-10-17 01:04:07 +05:30 committed by GitHub
parent cd6fca872b
commit 4a0f090f54
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 2 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
sorts/adaptive_merge_sort.py
View File

@ -1,7 +1,7 @@
def adaptive_merge_sort(sequence: list) -> list:
"""
Sorts a list using the Adaptive Merge Sort algorithm.
>>> adaptive_merge_sort([4, 3, 1, 2])
Initial sequence: [4, 3, 1, 2]
Sorting: array[0:2] and array[2:4]
@ -22,11 +22,10 @@ def adaptive_merge_sort(sequence: list) -> list:
print(f"Sorted sequence: {sequence}")
return sequence
def adaptive_merge_sort_helper(array: list, aux: list, low: int, high: int) -> None:
"""
Helper function for Adaptive Merge Sort algorithm.
>>> adaptive_merge_sort_helper([4, 3, 1, 2], [4, 3, 1, 2], 0, 3)
Sorting: array[0:2] and array[2:4]
Sorting: array[0:1] and array[1:2]
@ -48,7 +47,6 @@ def adaptive_merge_sort_helper(array: list, aux: list, low: int, high: int) -> N
return
merge(array, aux, low, mid, high)
def merge(array: list, aux: list, low: int, mid: int, high: int) -> None:
"""
Merges two sorted subarrays of the main array.