算法回锅肉——插入排序

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

#encoding:gbk

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

def insertion_sort(a)
	b = a.clone
	i = j = key = 0
	for j in 1...b.size
		key = b[j]
		i = j - 1
		while i >= 0 and b[i] > key	#将目标元素插入已排序的子数组，排序的主要成本发生在这里
			b[i + 1] = b[i]
			i -= 1
		end
		b[i + 1] = key
	end
	b
end

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

输出如下：

---------- Ruby ----------
[19, 11, 3, 6, 0, 11, 1, 6, 19, 7, 19, 3, 10, 12, 2, 1, 8, 0, 18, 7]
[0, 0, 1, 1, 2, 3, 3, 6, 6, 7, 7, 8, 10, 11, 11, 12, 18, 19, 19, 19]

Output completed (0 sec consumed) - Normal Termination