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 20:08:01 +00:00
parent b08a35c5d8
commit ad7fbab066
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
sorts/adaptive_merge_sort.py
View File

@ -50,7 +50,7 @@ def adaptive_merge_sort_helper(array: list, aux: list, low: int, high: int) -> N
if array[mid] <= array[mid + 1]: if array[mid] <= array[mid + 1]:
print(f"Skipping merge as array[{mid}] <= array[{mid + 1}]") print(f"Skipping merge as array[{mid}] <= array[{mid + 1}]")
array[low:high + 1] = aux[low:high + 1] array[low : high + 1] = aux[low : high + 1]
return return
merge(array, aux, low, mid, high) merge(array, aux, low, mid, high)