def QuickSort(myList,start,end):
    if start < end:
        i,j = start, end
        base = myList[i]
        while i < j:
            while (i
              
                = base):
                j = j -1
            myList[i] = myList[j]

            while (i
                
                  <= base):
                i = i + 1
            myList[j] = myList[i]
        myList[i] = base

        #遞歸前后半?yún)^(qū)
        QuickSort(myList,start, i-1)
        QuickSort(myList,j+1,end)
    return myList

myList = [1,9,3,8,6,12,28,37,86,99,100,29,38]

print("Qucik Sort:")
QuickSort(myList,0,len(myList)-1)
print(myList)
                
              
            
          

注：上述代碼的最終排序結(jié)果是在原列表上執(zhí)行，思想是：將基線樣本pivot sample 保存在變量base中。然后右邊比base小的樣本值傳入base原來的位置。