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:41:31 +05:30 committed by GitHub
parent ad7fbab066
commit 952dc0a4ed
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 4 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
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]:
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
merge(array, aux, low, mid, high)
@ -68,18 +68,12 @@ def merge(array: list, aux: list, low: int, mid: int, high: int) -> None:
i, j = low, mid + 1
for k in range(low, high + 1):
if i > mid:
if i > mid or (j <= high and array[j] < array[i]):
aux[k] = array[j]
j += 1
elif j > high:
aux[k] = array[i]
i += 1
elif array[i] <= array[j]: # Keep stable by using <=
aux[k] = array[i]
i += 1
else:
aux[k] = array[j]
j += 1
aux[k] = array[i]
i += 1
for k in range(low, high + 1):
array[k] = aux[k]