HeapSort : Java Glossary

go to home page H words local find full screen, hide local find menu Google search web for more information on this topic jump to foot of page translate this page with Babelfish punctuation 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z (all) ©1996-2009 Roedy Green, Canadian Mind Products
HeapSort
Williams and Floyd’s sorting algorithm that models employees jockeying for position on the corporate ladder. Another analogy is a tennis tournament where winners of low level contests (comparing bigness of key) compete at the next higher level. In Java, HeapSort is faster than QuickSort but slower than RadixSort. HeapSort is unstable in that it sometimes disturbs the order of existing records with equal keys. You can turn it into a stable sort by appending the existing order as a minor key. HeapSort is particularly fast if the data are already almost sorted. Free source code is available to download. To learn more about HeapSort’s behaviour:
Eppstein’s paper
HeapSort download
O(n²)
QuickSort
RadixSort
ShellSort
Sort
CMP homejump to top You can get the freshest copy of this page from: or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror)
http://mindprod.com/jgloss/heapsort.html J:\mindprod\jgloss\heapsort.html
CMP logofeedback Please email your feedback for publication, errors, omissions, typos, formatting errors, ambiguities, unclear wording, broken/redirected link reports, suggestions to improve this page or comments to Roedy Green : feedback email
mindprod.com IP:[65.110.21.43]
view BlogYour face IP:[38.107.191.106]
You are visitor number 26,734.