mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-12 04:18:08 +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:18:06 +05:30 committed by GitHub
parent 3cabfc6082
commit cb4acf52e3
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
sorts/adaptive_merge_sort.py
View File

@ -6,6 +6,8 @@ def adaptive_merge_sort(sequence: list) -> list:
Initial sequence: [4, 3, 1, 2] Initial sequence: [4, 3, 1, 2]
Sorting: array[0:2] and array[2:4] Sorting: array[0:2] and array[2:4]
Sorting: array[0:1] and array[1:2] Sorting: array[0:1] and array[1:2]
Merging: array[0:1] and array[1:2]
After merge: [3, 4]
Sorting: array[2:3] and array[3:4] Sorting: array[2:3] and array[3:4]
Skipping merge as array[0] <= array[1] Skipping merge as array[0] <= array[1]
Skipping merge as array[2] <= array[3] Skipping merge as array[2] <= array[3]
@ -22,7 +24,6 @@ def adaptive_merge_sort(sequence: list) -> list:
print(f"Sorted sequence: {sequence}") print(f"Sorted sequence: {sequence}")
return sequence return sequence
def adaptive_merge_sort_helper(array: list, aux: list, low: int, high: int) -> None: def adaptive_merge_sort_helper(array: list, aux: list, low: int, high: int) -> None:
""" """
Helper function for Adaptive Merge Sort algorithm. Helper function for Adaptive Merge Sort algorithm.
@ -30,8 +31,9 @@ def adaptive_merge_sort_helper(array: list, aux: list, low: int, high: int) -> N
>>> adaptive_merge_sort_helper([4, 3, 1, 2], [4, 3, 1, 2], 0, 3) >>> 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:2] and array[2:4]
Sorting: array[0:1] and array[1:2] Sorting: array[0:1] and array[1:2]
Merging: array[0:1] and array[1:2]
After merge: [3, 4]
Sorting: array[2:3] and array[3:4] Sorting: array[2:3] and array[3:4]
Skipping merge as array[0] <= array[1]
Skipping merge as array[2] <= array[3] Skipping merge as array[2] <= array[3]
Merging: array[0:2] and array[2:4] Merging: array[0:2] and array[2:4]
After merge: [1, 2, 3, 4] After merge: [1, 2, 3, 4]
@ -48,7 +50,6 @@ def adaptive_merge_sort_helper(array: list, aux: list, low: int, high: int) -> N
return return
merge(array, aux, low, mid, high) merge(array, aux, low, mid, high)
def merge(array: list, aux: list, low: int, mid: int, high: int) -> None: def merge(array: list, aux: list, low: int, mid: int, high: int) -> None:
""" """
Merges two sorted subarrays of the main array. Merges two sorted subarrays of the main array.
@ -72,4 +73,5 @@ def merge(array: list, aux: list, low: int, mid: int, high: int) -> None:
else: else:
aux[k] = array[i] aux[k] = array[i]
i += 1 i += 1
array[low:high + 1] = aux[low:high + 1] # Update the main array with merged values
print(f"After merge: {aux[low:high + 1]}") print(f"After merge: {aux[low:high + 1]}")