Slide 1 Heapsort Slide 2 Why study Heapsort? It is a well-known, traditional sorting algorithm you will be expected to know Heapsort is always O(n log n) –Quicksort is…
Slide 1 Heapsort http://www.cis.upenn.edu/~matuszek/cit594-2008/ Based off slides by: David Matuszek Slide 2 2 Previous sorting algorithms Insertion Sort O(n 2 ) time Merge…