HeapSort : Java Glossary

by Roedy Green ©1996-2009 Canadian Mind Products
index page for letter ⇒ 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)

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

	Please email your feedback for publication, errors, omissions, broken/redirected link reports and suggestions to improve this page to Roedy Green :
	Canadian Mind Products
	mindprod.com IP:[65.110.21.43]
	Your face IP:[38.103.63.62]	The information on this page is for non-military use only.
	You are visitor number 24,827.	Military use includes use by defence contractors.
	You can get a fresh 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