Sorting algorithms/Counting sort: Difference between revisions

Content added Content deleted
(add Ruby)
Line 446: Line 446:
return [x for x, n in enumerate(cnt, start=min)
return [x for x, n in enumerate(cnt, start=min)
for i in xrange(n)]</lang>
for i in xrange(n)]</lang>

=={{header|Ruby}}==
<lang ruby>class Array
def countingsort!
do_countingsort!(min, max)
end
protected
def do_countingsort!(min, max)
count = Array.new(max - min + 1, 0)
each {|number| count[number - min] += 1}
z = 0
min.upto(max) do |i|
while count[i - min] > 0
self[z] = i
z += 1
count[i - min] -= 1
end
end
self
end
end

ary = [9,7,10,2,9,7,4,3,10,2,7,10,2,1,3,8,7,3,9,5,8,5,1,6,3,7,5,4,6,9,9,6,6,10,2,4,5,2,8,2,2,5,2,9,3,3,5,7,8,4]
ary.countingsort!.join(",")
# => "1,1,2,2,2,2,2,2,2,2,3,3,3,3,3,3,4,4,4,4,5,5,5,5,5,5,6,6,6,6,7,7,7,7,7,7,8,8,8,8,9,9,9,9,9,9,10,10,10,10"</lang>


=={{header|Smalltalk}}==
=={{header|Smalltalk}}==