《python算法教程》Day9 - 快速排序法快速排序法简介代码展示

#快速排序
import numpy as np

def partition(seq):
    lo=[x for x in seq if x<seq[0]]
    hi=[x for x in seq if x>seq[0]]
    return lo ,seq[0],hi
    
def quickSort(seq):
    if len(seq)<=1:
        return seq
    lo,pi,hi=partition(seq)
    return quickSort(lo) + [pi] + quickSort(hi)

#生成随机整数序列，用于测试排序算法
seq=np.random.randint(0,100,100)
print(seq)
res=quickSort(seq)
print(res)

#快速排序
import numpy as np

def quickSort(seq):
    if len(seq)<=1:
        return seq
    i=0
    j=len(seq)-1
    k=seq[0]
    while i<j:
        while i<j and k<=seq[j]:
            j-=1
        seq[i],seq[j]=seq[j],seq[i]
        while i<j and k>=seq[i]:
            i+=1
        seq[i],seq[j]=seq[j],seq[i]
    #print(seq[0:i],seq[i+1:len(seq)])
    return quickSort(seq[0:i]) +[k]+quickSort(seq[i+1:len(seq)])

#生成随机整数序列，用于测试排序算法
seq=[x for x in np.random.randint(0,100,50)]
print(seq)
res=quickSort(seq)
print(res)