Sort algorithms home

Java C FORTRAN PASCAL

sort simple sort In-place sort quicksort balanced quicksort introspective sort insertion sort selection sort diminishing increment sort shell sort heapsort adaptive heap sort introspective sort adaptive sort adaptive heap sort distribution sort bin sort range sort counting sort histogram sort merge sort

selection sort Also defined at: http://www.nist.gov/dads/HTML/selectionsrt.html . Inherits from In-place sort An algorithm which orders items by repeatedly looking through remaining items to find the least one and moving it to a final location. [National Institute of Standards and Technology] Demonstrations: http://www.cosc.canterbury.ac.nz/people/mukundan/dsal/SSort.html Implementations and sample code: http://www.cs.ubc.ca/spider/harrison/Java/sorting-demo.html [Java]

Author: Nikita Ogievetsky, © Cogitech, Inc. 2002