lua的快排(QuickSort)

-- QuickSort Lua version
function QuickSort_partition(t,l,h)
	local x = t[h]
	local i = l - 1
	for j=l,h do
		if t[j] < x then
			i = i+1
			t[j], t[i] = t[i], t[j]
		end
	end
	t[h], t[i+1] = t[i+1], t[h]
	return i+1
end
function QuickSort(t,l,h)
	if l >= h then return end
	local p = QuickSort_partition(t,l,h)
	QuickSort(t,l,p-1)
	QuickSort(t,p+1,h)
end

t = {1,85,9,7,6,3,4,8,7,5}
QuickSort(t,1,#t)

for i=1,#t do
	print(t[i])
end

扔在这里，等哪天会用到。