Heap Sort

Hello!

To view this page you need Microsoft Silverlight 3 plug-in.
Silverlight will enable your browser to understand complex Rich Internet Applications.
After installing (~10 seconds), you will be able to view and execute live algorithms.

Click here to download the plugin directly from Microsoft (4 MB)
If you want to learn more about MS Silverlight, take a look at this Wikipedia article.
Output
type in the input above and click 'Execute'
the result will be outputted here
Related Algorithms
Discussion
1
Nice clean implementation. I did slightly modified your code (consolidated all helper functions inside Execute) to enable external calls.
30 months and 2 weeks ago by ANaimi
login to leave a comment
Version 1
Version 1 by princeofcode
+1
Heap Sort is a comparison-based sorting algorithm, and is part of the selection sort family. Although somewhat slower in practice on most machines than a good implementation of quicksort, it has the advantage of a worst-case O(n log n) runtime. Heap Sort is an in-place algorithm, but is not a stable sort. This algorithm should be used when there are concerns about the worst-case performance when sorting. It should not be used on value-based data because it moves elements around frequently.

More information: http://en.wikipedia.org/wiki/Heapsort
By princeofcode
30 months and 2 weeks ago
up down

implementations

one version available

rated by

one user - list?

viewed by

13 users - list?

favorited by

0 users - list?

last activity

30 months and one week ago

tags

Sorting