-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathheapsort.py
More file actions
27 lines (24 loc) · 742 Bytes
/
Copy pathheapsort.py
File metadata and controls
27 lines (24 loc) · 742 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
import logging
def heap_sort(arr):
try:
n = len(arr)
for i in range(n//2 - 1, -1, -1):
heapify(arr, n, i)
for i in range(n-1, 0, -1):
arr[i], arr[0] = arr[0], arr[i]
heapify(arr, i, 0)
return arr
except Exception as e:
logging.exception("An error occurred during heap sort: %s", e)
return "An error occurred during heap sort: {}".format(str(e))
def heapify(arr, n, i):
largest = i
l = 2 * i + 1
r = 2 * i + 2
if l < n and arr[l] > arr[largest]:
largest = l
if r < n and arr[r] > arr[largest]:
largest = r
if largest != i:
arr[i], arr[largest] = arr[largest], arr[i]
heapify(arr, n, largest)