Next: 0.3.6.1 Analysis
Up: 0.3 Sorting Algorithms
Previous: 0.3.5.3 Source Code
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.