Heap Sort

problem with selection sort that causes it to be slow is that it always scans the entire list to find the smallest element. Heap sort is a solution to this problem. by creating a heap data structure, we can find the smallest element in O(log n) time.