Anonymous user
Sorting algorithms/Comb sort: Difference between revisions
m
Move pseudocode to description and remove "implementations" header
(add Ruby) |
m (Move pseudocode to description and remove "implementations" header) |
||
Line 4:
*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.
Pseudocode:
function combsort(array input)
gap := input.size //initialize gap size
Line 24:
end function
=={{header|C++}}==
This is copied from [[wp:Comb sort|the Wikipedia article]].
| |||