mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-07 10:00: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:56:16 +00:00
parent f331afd6e3
commit eb3284d6f0
1 changed files with 2 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
sorts/adaptive_merge_sort.py
View File

@ -23,6 +23,7 @@ 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.
@ -49,6 +50,7 @@ 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.