算法回锅肉——快速排序

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

#encoding:gbk

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

def partition(a,p,r) #分片，粗糙拆分为两类
	x = a[r]
	i = p - 1
	for j in p..r - 1
		if a[j] < x
			i += 1
			a[i],a[j] = a[j],a[i]
		end
	end
	i += 1
	a[i],a[r] = a[r],a[i]
	i
end

def quick_sort(a,p,r)
	if p < r
		q = partition(a,p,r)
		quick_sort(a,p,q - 1) #递归快速排序
		quick_sort(a,q + 1,r)
	end
end

puts arr.inspect
arrc = arr.clone
quick_sort(arrc,0,arrc.size - 1)
puts arrc.inspect

输出如下：

---------- Ruby ----------
[13, 8, 13, 0, 1, 16, 16, 15, 4, 18, 14, 9, 11, 19, 7, 3, 5, 7, 6, 3]
[0, 1, 3, 3, 4, 5, 6, 7, 7, 8, 9, 11, 13, 13, 14, 15, 16, 16, 18, 19]

Output completed (0 sec consumed) - Normal Termination