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 |
shell sort
Inherits from diminishing increment sort
The first diminishing increment sort. Originally the first increment was half the number of items to be sorted, i.e., n/2, and each succeeding increment was half the preceding increment. [National Institute of Standards and Technology]
Demonstrations: | http://www.cs.ubc.ca/spider/harrison/Java/sorting-demo.html
Implementations and sample code: | http://www.cs.carleton.ca/%7Emorin/misc/sortalg/ [Java] http://www.certified-capital.com/examples/asp/sorting/ShellSort/default.asp [] http://lib.stat.cmu.edu/apstat/304 [FORTRAN] http://www.nmt.edu/%7Ees421/pascal/sort.htm [PASCAL]