博客

li=[13,2,7,43,22,15,8,3,23]

#冒泡排序
def bubbleSort(li):

    for i in range(len(li)-1):
        for j in range(len(li)-i-1):

            if li[j]>li[j+1]:
                li[j],li[j+1]=li[j+1],li[j]
#选择排序
def selectSort(li):

    for i in range(len(li)-1):
        min = i
        for j in range(i+1,len(li)):

            if li[min] > li[j ]:
                li[min], li[j] = li[j], li[min]

#插入排序
def insertSort(li):

    for i in range(len(li)):
        tmp = li[i]
        j = i - 1

        while j >= 0 and li[j]>tmp:
            li[j+1] = li[j]
            j = j - 1

        li[j+1] = tmp
#快速排序
def partition(li,left,right):
    tmp = li[left]
    while left < right:
        while left < right and li[right] > tmp:
            right -= 1
        li[left] = li[right]

        while left < right and li[left] < tmp:
            left += 1
        li[right] = li[left]

    li[left] = tmp
    return left

def quickSort(li,left,right):
    if left < right:
        mid = partition(li,left,right)
        quickSort(li,mid+1,right)
        quickSort(li,left,mid-1)

# bubbleSort(li)
# selectSort(li)
# insertSort(li)
quickSort(li,0,len(li)-1)
print(li)