Sorting algorithms/Bead sort: Difference between revisions

m
→‎{{header|Phix}}: Shorter still
m (added whitespace to the task's preamble.)
m (→‎{{header|Phix}}: Shorter still)
Line 1,866:
sequence poles = repeat(0,max(a))
for i=1 to length(a) do
integer aipoles[1..a[i]] = sq_add(poles[1..a[i]],1)
poles[1..ai] = sq_add(poles[1..ai],1)
end for
sequence resa[1..$] = repeat(0,length(a))
for i=1 to length(poles) do
integer pia[1..poles[i]] = sq_add(a[1..poles[i]],1)
res[1..pi] = sq_add(res[1..pi],1)
end for
return resa
end function
7,813

edits