Comb sort is a relatively simplistic sorting algorithm
originally designed by Wlodzimierz Dobosiewicz in 1980.
Comb sort improves on bubble sort, and rivals algorithms
like quick sort. The basic idea is to eliminate turtles, or small
values near the end of the list, since in a bubble sort these
slow the sorting down tremendously. Rabbits, large values
around the beginning of the list, do not pose a problem in
bubble sort. The shrink factor has a great effect on the
efficiency of comb sort. In the original article, the author
suggested 4/3. A value too small slows the algorithm down
because more comparisons must be made, whereas a value
too large means that no comparisons will be made. Text
describes an improvement to comb sort using the base value
as the shrink factor (where is the golden ratio). It also
contains a pseudo code implementation with a pre-defined
gap table.