python实现快速排序算法

def partition(arr, low, hight):
    i = low - 1
    for j in range(low, hight):
        if arr[j] <= arr[hight]:
            i = i + 1
            arr[i], arr[j] = arr[j], arr[i]
    arr[i + 1], arr[hight] = arr[hight], arr[i + 1]
    return i

def quick_sort(l, low, hight):
    if low < hight:
        key_Index = partition(l, low, hight)
        quick_sort(l, low, key_Index)
        quick_sort(l, key_Index + 1, hight)
    else:
        return

l = [5,8,1,3,15,12,0]
quick_sort(l, 0, len(l) - 1)
print("after sort:", l)

# 运行后的结果为：after sort: [0, 1, 3, 5, 8, 12, 15]