nist.gov's "diminishing increment sort" definition mentions the term 'comb sort' as visualizing iterative passes of the data, "where the teeth of a comb touch;" the former term is linked to Don Knuth.

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.

A value too small slows the algorithm down by making unnecessarily many comparisons, whereas a value too large fails to effectively deal with turtles, making it require many passes with a gap of 1.

This is the reason that Shellsort gap sequences have a larger optimal shrink factor of about 2.25.