Function heapSort

heap_sort.py:30–41

(arr)

# Main function
def heapSort(arr):
    n = len(arr)

    # Make a heap
    for i in range(n // 2 - 1, -1, -1):
        refineHeap(arr, n, i)

    # Extract elements individually
    for i in range(n - 1, 0, -1):
        # Fancy notation for swapping two values in an array
        arr[i], arr[0] = arr[0], arr[i]
        refineHeap(arr, i, 0)


# Code that will run on start