Heapsort. - ppt download

Heapsort. - ppt download: 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 usually O(n log n) but in the worst case slows to O(n2) Quicksort is generally faster, but Heapsort has the guaranteed O(n log n) time and can be used in time-critical applications Heapsort is a really cool algorithm!