insertion sort
Sort algorithms home
JavaCFORTRANPASCAL
sort
insertion sort [linear insertion sort]
Inherits from In-place sort
Sort by repeatedly taking the next item and inserting it into the final data structure in its proper order with respect to items already inserted. Run time is O(n2) because of moves. [National Institute of Standards and Technology]
Demonstrations: http://www.cosc.canterbury.ac.nz/people/mukundan/dsal/ISort.html
Implementations and sample code: http://gams.nist.gov/serve.cgi/Module/TOMS/505/8547 [FORTRAN]
http://www.cs.ubc.ca/spider/harrison/Java/InsertionSortAlgorithm.java [Java]
http://www.cs.sunysb.edu/%7Ealgorith/files/sorting.shtml []