Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 12:16:14 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update heap_sort.py

Browse Source
This commit is contained in:
bt3gl 2023-08-08 16:33:04 -07:00 committed by GitHub
parent 4002609137
commit 3d8b77bf80
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 9 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
heaps/heap_sort.py
View File

@ -3,25 +3,26 @@
# author: bt3gl
def heap_sort(self, lst: List[int]) -> None:
def heap_sort(self, array) -> list:
def max_heapify(heap_size, index):
left, right = 2 * index + 1, 2 * index + 2
largest = index
if left < heap_size and lst[left] > lst[largest]:
if left < heap_size and array[left] > array[largest]:
largest = left
if right < heap_size and lst[right] > lst[largest]:
elif if right < heap_size and array[right] > array[largest]:
largest = right
if largest != index:
lst[index], lst[largest] = lst[largest], lst[index]
elif largest != index:
array[index], array[largest] = array[largest], array[index]
max_heapify(heap_size, largest)
for i in range(len(lst) // 2 - 1, -1, -1):
max_heapify(len(lst), i)
max_heapify(len(array), i)
for i in range(len(lst) - 1, 0, -1):
lst[i], lst[0] = lst[0], lst[i]
for i in range(len(array) - 1, 0, -1):
array[i], array[0] = array[0], array[i]
max_heapify(i, 0)
return array