Sorting algorithms/Comb sort: Difference between revisions
m
J: clarify description
m (moved Comb sort to Sorting algorithms/Comb sort: consistent with other sorting algorithms) |
m (J: clarify description) |
||
Line 80:
=={{header|J}}==
Large gap sizes allow some parallelism in comparisons and swaps. (If the gap size is G, then G pairs can be compared and swapped in parallel.) Beyond that, however, the data flow complexity of this algorithm requires a fair bit of micro-management.
<lang J>combSort=:3 :0
| |||