快速排序——python

快速排序：

        基本思想：以key值为分割点，左边比key小，右边比key大。再左右两边递归。

        具体步骤如下：（严格按照如下步骤实现）

def quick_sort(a, low, high):
    i = low
    j = high
    if i >= j:
        return a
    key = a[i]
    while i < j:
        while i < j and a[j] >= key:
            j = j-1
        a[i] = a[j]
        while i < j and a[i] <= key:
            i = i+1
        a[j] = a[i]
    a[i] = key
    quick_sort(a, low, i-1)
    quick_sort(a, j+1, high)
    return a