sorting-visualizer-using-python/heapSort.py at main · vishalbaluri/sorting-visualizer-using-python · GitHub

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
28
29
30
31
32
33
import time
from colors import *

def heapify(data, n, i, drawData, timeTick):
    largest = i
    left = 2*i+1
    right = 2*i+2

    if left < n and data[i] < data[left]:
        largest = left

    if right < n and data[largest] < data[right]:
        largest = right

    if largest != i:
        data[i], data[largest] = data[largest], data[i]
        heapify(data, n, largest, drawData, timeTick)


def heap_sort(data, drawData, timeTick):
    n = len(data)

    for i in range(n-1, -1, -1):
        heapify(data, n, i, drawData, timeTick)

    for i in range(n-1, 0, -1):
        data[i], data[0] = data[0], data[i]
        heapify(data, i, 0, drawData, timeTick)
        drawData(data, [YELLOW if x == i else BLUE for x in range(n)])
        time.sleep(timeTick)

    drawData(data, [BLUE for x in range(len(data))])