快速排序-python

快速排序

# coding=utf-8

def partiton(alist, start, end):
    base = alist[start]
    left = start
    right = end
    while left < right:
        while alist[right] >= base and left < right:
            right -= 1
        alist[left] = alist[right]
        while alist[left] < base and left < right:
            left += 1
        alist[right] = alist[left]
    alist[left] = base
    return left

def quick_sort(alist, start, end):
    if start < end:
        mid = partiton(alist, start, end)
        quick_sort(alist, start, mid-1)
        quick_sort(alist, mid+1, end)
    else:
        return


if __name__ == '__main__':
    test_list = [2, 1, 5, 3, 7, 2]
    quick_sort(test_list, 0, len(test_list)-1)
    print test_list