Heapsort

• Algorithms Lesson 9: Heaps

http://www.youtube.com/watch?v=v1YUApMYXO4&feature=fvwrel

• Algorithms Lesson 10: Heapsort

http://www.youtube.com/watch?v=6NB0GHY11Iw

• Heapsort

Heapsort is a comparison-based sorting algorithm to create a sorted array (or list), and is part of the selection sort family
has the advantage of a more favorable worst-case O(n log n) runtime


Heapsort is a two step algorithm.
The first step is to build a heap out of the data.
The second step begins with removing the largest element from the heap

http://en.wikipedia.org/wiki/Heapsort

• Heap Sort Algorithm

The heap sort combines the best of both merge sort and insertion sort. Like merge sort, the worst case time of heap sort is O(n log n) and like insertion sort, heap sort sorts in-place.
http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Sorting/heapSort.htm