Comb sort
Sorting algorithm
>
Comb sort is a relatively simple sorting algorithm originally designed by Włodzimierz Dobosiewicz and Artur Borowy in 1980, later rediscovered by Stephen Lacey and Richard Box in 1991. Wikipedia
Worst-case complexity: n^2
Stable: No
Best complexity: n
Average performance: , where p is the number of increments
Data structure: Array