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

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

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-10-16 19:49:10 +00:00
parent cb4acf52e3
commit 15578e80c6
1 changed files with 5 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
sorts/adaptive_merge_sort.py
View File

@ -24,6 +24,7 @@ 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.
@ -50,6 +51,7 @@ 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.
@ -73,5 +75,7 @@ def merge(array: list, aux: list, low: int, mid: int, high: int) -> None:
else:
aux[k] = array[i]
i += 1
array[low:high + 1] = aux[low:high + 1] # Update the main array with merged values
array[low : high + 1] = aux[
low : high + 1
] # Update the main array with merged values
print(f"After merge: {aux[low:high + 1]}")