Comb sort 11 sort algorithm demonstration.
Idea from Byte April 1991 by Richard Box and Stephen Lacey
Michele Estebon (mestebon@vt.edu) brought this to my attention.
Author Jason Harrison; his version: 1.0, 20 Nov 1996
Comb sort is a variant of the Bubble Sort. The gap used in comparisons
and possibly exchanges starts with the array's length (/1.3). The gap is
reduced by dividing by 1.3 at every round. A gap of 9 and 10 (after the
division) is set to 11 hence the name. By this 11 we have in the
end gaps of 11, 8, 6, 4, 3, 2, 1, which is considered the optimum.
Modif. 15.11.2005, Albrecht Weinert (a-weinert.de) :
SortApp.SortAlgorithm
+ minor improvements.