Anonymous user
Sorting algorithms/Comb sort: Difference between revisions
m
added whitespace before the TOC.
(Added Elixir) |
m (added whitespace before the TOC.) |
||
Line 2:
{{task|Sorting Algorithms}}{{Sorting Algorithm}}
The '''Comb Sort''' is a variant of the [[Bubble Sort]].
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-e^{-\varphi})^{-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]].▼
▲
Some implementations use the insertion sort once the gap is less than a certain amount.
See the [[wp:Comb sort|article on Wikipedia]].
Variants:
*Combsort11 makes sure the gap ends in (11, 8, 6, 4, 3, 2, 1), which is significantly faster than the other two possible endings
*Combsort with different endings changes to a more efficient sort when the data is almost sorted (when the gap is small). Comb sort with a low gap isn't much better than the Bubble Sort.
<br>
Pseudocode:
'''function''' combsort('''array''' input)
Line 30 ⟶ 39:
'''end loop'''
'''end function'''
<br><br>
=={{header|ActionScript}}==
| |||