Sorting algorithms/Counting sort: Difference between revisions
Content added Content deleted
m (→{{header|REXX}}: removed OVERFLOW from PRE html tag.) |
m (Added Sidef language.) |
||
Line 1,704: | Line 1,704: | ||
case (lst, (cnt, ndx)) => List.fill(cnt)(ndx + min) ::: lst |
case (lst, (cnt, ndx)) => List.fill(cnt)(ndx + min) ::: lst |
||
}.reverse</lang> |
}.reverse</lang> |
||
=={{header|Sidef}}== |
|||
<lang ruby>func counting_sort(a, min, max) { |
|||
var cnt = ([0] * (max - min + 1)); |
|||
a.each { |i| cnt[i-min]++ }; |
|||
return cnt.map {|i| min++; [min-1] * i}.sum; |
|||
} |
|||
var a = 100.of {100.rand.int}; |
|||
say counting_sort(a, 0, 100).dump;</lang> |
|||
=={{header|Slate}}== |
=={{header|Slate}}== |