Sorting algorithms/Comb sort: Difference between revisions

{{task|Sorting Algorithms}}{{Sorting Algorithm}}The '''Comb Sort''' is a variant of the [[Bubble Sort]]. Like the [[Shell sort]], the Comb Sort increases the gap used in comparisons and exchanges (dividing the gap by <math>1/\left(1-\frac{1}{e^{-\varphi}\right)^{-1} \approx 1.247330950103979</math> works best, but 1.3 may be more practical). Some implementations use the insertion sort once the gap is less than a certain amount. See the [[wp:Comb sort|article on Wikipedia]].