算法回锅肉——冒泡排序

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

#encoding:gbk

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

def bubble_sort(a)
	b = a.clone
	i = j = 0

	for i in 0...b.size - 1
		(b.size - 1).downto i + 1 do |j|
			b[j],b[j-1] = b[j - 1],b[j] if b[j] < b[j - 1] #简单粗暴，反复低效
		end
	end
	b
end

puts arr.inspect
res = bubble_sort(arr)
puts res.inspect

输出如下：

---------- Ruby ----------
[17, 15, 9, 5, 1, 17, 19, 12, 10, 13, 2, 9, 6, 10, 13, 17, 17, 15, 14, 9]
[1, 2, 5, 6, 9, 9, 9, 10, 10, 12, 13, 13, 14, 15, 15, 17, 17, 17, 17, 19]

Output completed (0 sec consumed) - Normal Termination