Anonymous user
Sorting algorithms/Comb sort: Difference between revisions
m
missed a spot
m (format the pseudocode) |
m (missed a spot) |
||
Line 13:
swaps := 0 ''//see [[Bubble Sort]] for an explanation''
''//a single "comb" over the input list''
'''loop until''' i + gap >= input'''.size''' ''//see [[Shell sort]] for similar idea''
'''if''' input[i] > input[i+gap]
'''swap'''(input[i], input[i+gap])
| |||