next up previous contents index Search
Next: Analysis Up: 0.3 Sorting Algorithms Previous: Source Code

0.3.6 Shellsort


The Shellsort, also known as the diminishing increment sort,   exploits the excellent best-case performance of the Insertion Sort by attempting to ``almost sort'' a data set and then call an Insertion   Sort to finish off the sorting process. This is very similar to the optimization discussed at the end of the Quicksort section.

Scott Gasch