Sorting algorithms/Cycle sort: Difference between revisions
m
→{{header|Sidef}}: update
(Added XPL0 example.) |
m (→{{header|Sidef}}: update) |
||
Line 2,266:
func f(i, Ref item, bool=false) {
pos = (i + array.
return(false) if (bool && pos==i)
while (*item == array[pos]) { ++pos }
Line 2,276:
array.each_kv { |i, item|
f(i, \item, true) || next
while (pos
f(i, \item)
}
| |||