算法回锅肉——计数排序

示例代码纯粹是为了加深印象，选择的目标语言有更便捷的实现方式，另外去掉了一些假设条件检查。

#encoding:gbk

Size = 20
arr = Array.new(Size) do	#初始化待排序数组，随机填写元素
	rand(Size)
end

def counting_sort(a,b,k)
	c = Array.new(k + 1,0) #下标数组
	a.each do |x|
		c[x] += 1	#计数
	end
	c.each_with_index do |x,i|
		next if i == 0
		c[i] += c[i - 1] #累计计数
	end
	a.each do |x|
		b[c[x] - 1] = x #放置元素
		c[x] -= 1 #为相同输入挪动下标
	end
end

puts arr.inspect
a = arr.clone	#输入数组
b = Array.new(a.size,-1)	#输出数组，初始化为-1以便观测
k = a.size	#下标最大值
counting_sort(a,b,k)
puts b.inspect

输出如下：

---------- Ruby ----------
[14, 7, 18, 8, 0, 8, 14, 5, 12, 15, 6, 2, 11, 8, 12, 11, 12, 15, 9, 0]
[0, 0, 2, 5, 6, 7, 8, 8, 8, 9, 11, 11, 12, 12, 12, 14, 14, 15, 15, 18]

Output completed (1 sec consumed) - Normal Termination