This is a visualized Comb Sort program. Turbo mode recommended. Comb Sort works very similarly to Bubble Sort. They both compare elements, but instead of adjacent elements, Comb Sort compares elements over a gap (1.3 times the array length), which is reduced by a factor of 1.3 on each pass. This way, Comb Sort avoids having smaller elements "bubble" very slowly to the beginning of the array, and is thus more efficient than Bubble Sort.
