Function heapSort

Python/Sorting-Techniques/heapSort.py:17–25

(arr)

		heapify(arr, N, largest)

def heapSort(arr):
	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)

if __name__ == '__main__':
	arr = [12, 11, 13, 5, 6, 7]