python实现快速排序

最近看别人用python实现的快速排序，感觉真的好简练，这里做个保存

# -*- coding: utf-8 -*-


# 定义快排的方法

def quickSort(L, low, high):
    i = low
    j = high
    if i >= j:
        return L
    key = L[i]
    # 这里是从小到大的顺序排列的
    while i < j:
        while i < j and L[j] >= key:
            j = j - 1
        L[i] = L[j]
        while i < j and L[i] <= key:
            i = i + 1
        L[j] = L[i]
    L[i] = key
    quickSort(L, low, i-1)
    quickSort(L, j+1, high)

    return L


print 'into main function'

test = [1, 3, 2, 8, 9, 0]

test_1 = quickSort(test, 0, len(test) - 1)

print test