本文共 1596 字，大约阅读时间需要 5 分钟。

快速排序：

import randomimport timeitdef randomList(n):    iList = []    for i in range(n):        iList.append(random.randrange(0,1000))    return iListdef bubblesort(iList):    if (len(iList)<=1):        return iList    for i in range(1,len(iList)):        for j in range(0,len(iList)-i):            if(iList[j]>iList[j+1]):                iList[j],iList[j+1] = iList[j+1],iList[j]    return iListdef selectsort(iList):    if(len(iList)<=1):        return iList    for i in range(0,len(iList)-1):        if iList[i] != min(iList[i:]):            minIndex = iList.index(min(iList[i:]))            iList[i],iList[minIndex] = iList[minIndex],iList[i]    return iListdef insetionsort(iList):    if(len(iList)<=1):        return iList    for right in range(1,len(iList)):        target = iList[right]        for left in range(0,right):            if target<=iList[left]:                iList[left+1:right+1] = iList[left:right]                iList[left] = target;                break    return iListdef quicksort(iList):    if(len(iList)<=1):        return iList    left = []    right = []    for i in iList[1:]:        if i<=iList[0]:            left.append(i)        else :            right.append(i)     return quicksort(left)+[iList[0]]+quicksort(right)if __name__ == "__main__":    iList = randomList(20)    print(iList)    print(quicksort(iList))    #print(timeit.timeit("selectsort(iList)","from _main_ import selectsort,iList",number=100))