Python随笔-快排

def swap(arr, i, j):
    temp = arr[i]
    arr[i] = arr[j]
    arr[j] = temp

def part(arr, beg, end):
    if end - beg <= :
        return beg
    v = arr[beg]
    idx = beg +
    for x in range(beg+, end+):
        if(arr[x] < v):
            swap(arr, idx, x)
            idx +=
    swap(arr, idx-, beg)
    return idx-

def sort(arr, beg, end):
    if end - beg <= :
        return
    i = part(arr, beg, end)
    sort(arr, beg, i)
    sort(arr, i+, end)

arr = [, , , , , , , , , , , , , , ]
sort(arr, , len(arr)-)
print(arr)