快排O(nlgn)

def quick_sort(lst, left, right):
    if left >= right:
        return lst
    i = left
    j = right
    temp = lst[i]
    while i < j:
        while i < j and lst[j] > temp:
            j -= 1
        lst[i] = lst[j]
        while i < j and lst[i] < temp:
            i += 1
        lst[j] = lst[i]
    lst[i] = temp
    quick_sort(lst, left, i - 1)
    quick_sort(lst, j + 1, right)

    return lst, i, j

a = [6,8,7,1,0,2,9,3,4,5]

result , i , j= quick_sort(a, 0, len(a) - 1)
print(result)
print(i)
print(j)



'''另一种'''''
def quick_sort(qlist):
    if qlist == []:
        return []
    else:
        qfirst = qlist[0]
        qless = quick_sort([l for l in qlist[1:] if l < qfirst])
        qmore = quick_sort([m for m in qlist[1:] if m >= qfirst])
        return qless + [qfirst] + qmore
 
qlist = quick_sort([4,5,6,7,3,2,6,9,8])
print(qlist )