快速排序，python實現與測試

import random

'''
隨機列表
'''
def randmom_list():
    list = []
    i=0
    key = random.randint(10,30)
    while i <= key:
        list.append(random.randint(1,100))
        i = i+1
    print(list)
    return list



'''
快速排序
'''

def Quicksort(list,L,R):

    if L>=R:
        print(list)
        return

    left = L
    right =R
    key =list[left]

    while left<right:

        while left < right and list[right] >= key:
            right = right - 1
        list[left] = list[right]

        while left < right and list[left] < key:
            left = left + 1
        list[right] = list[left]

        if left >= right:
            list[left] = key

    Quicksort(list,L,right-1)
    Quicksort(list,right+1,R)

list = randmom_list()
Quicksort(list,0,len(list)-1)