Comb Sort

is a sorting algorithm that sorts by making comb passes with a gap sequence. A comb pass consists of starting i at 0, then compare-exchanging i and i+gap and incrementing i, while iThe original Dobosiewicz version starts the gap at size/2, uses a shrink factor of 4/3 (about ), and the passes of 1 are in form of an optimised Bubble Sort that stops each 1 pass at the last swap of the previous 1 pass.Lacey & Box suggest a 1.3 shrink factor.A shrink factor of 1/(1-exp (-((sqrt 5)+1)/2)) (about ) has unknown properties.For shrink factors 9/7

3-smooth gaps
A gap sequence requiring only one 1 pass, is use 3-smooth numbers. Each gap is preceded by two and three times larger gaps. So, 1 is preceded by 2 and 3, but 2 in turn is preceded by 4 and 6, and 3 is preceded by 6 and 9, and so on. It may be implemented by recursively sorting with gap 3 then use powers of 2, or recursively sorting with gap 2 then use powers of 3. It has O (n×(log n)²) best case, average case, and worst case and it is a sorting network.