Sorting algorithms/Radix sort: Difference between revisions

Line 959:
#
func sort . data[] .
radix = 25610
maxfor =d 0in data[]
max = data[di]higher d max
for di range len data[]
if data[di] > max
max = data[di]
.
.
len buck[][] radix
Line 970 ⟶ 967:
while pos <= max
for i range radix
len buck[i][] 0= [ ]
.
for did range lenin data[]
h = data[di]d / pos mod radix
buck[h][] &= data[di]d
.
di = 0
for i range radix
for jd range lenin buck[i][]
data[di] = buck[i][j]d
di += 1
.
1,978

edits