算法_快排_python

#快排
def quick(begin,end,lst):
    if begin > end:
        return
    print('---------------------------')
    beg = begin
    ed = end
    while beg < ed:
        while beg<ed and lst[beg]<lst[ed]:
            beg +=1
        while beg < ed and lst[beg] <lst[ed]:
            ed-=1
        
        lst[beg],lst[ed] = lst[ed],lst[beg]
        print(lst)
    
    quick(begin,beg-1,lst)
    quick(ed+1,end,lst)
    return lst

if __name__ == "__main__":
    ll = [9,3,11,0,4,5,6,8]
    print(quick(0,len(ll)-1,ll))