算法导论--------快速排序

下面是python实现的快速排序算法:

def quick_sort(ary,low,high):
    if low < high:
        q = partiton(ary,low,high)
        quick_sort(ary,low,q-1)
        quick_sort(ary,q+1,high)

def partiton(ary,low,high):
    x = ary[high]
    i = low - 1

    for j in range(low,high):
        if ary[j] <= x:
            i += 1
            ary[i],ary[j] = ary[j],ary[i]

    ary[i+1],ary[high] = ary[high],ary[i+1]
    return i + 1

ary = [3,4,1,2,8,9,0,10]
quick_sort(ary,0,len(ary)-1)
print(ary)