冒泡排序，选择排序，插入排序，快速排序

# 插入排序
def insert_sort(a_list):
    n = len(a_list)
    for i in range(1, n):
        for j in range(i, 0, -1):
            if a_list[j]>a_list[j-1]:
                a_list[j], a_list[j-1] = a_list[j-1], a_list[j]

# insert_sort(a_list=list_data)
# print(list_data)

# 快速排序
list_data=[35,10,24,12,43,11,33,54]
def quick_sort(alist,start,end):
    if start >= end:
        return
    mid = alist[start]
    low=start
    hight=end
    while low<hight:
        while low<hight and alist[hight]>=mid:
            hight-=1
        alist[low]=alist[hight]
        while low<hight and alist[low]<mid:
            low += 1
        alist[hight] = alist[low]
    alist[low]=mid
    quick_sort(alist, start, low-1)
    quick_sort(alist, low+1, end)
quick_sort(list_data,0,len(list_data)-1)
print(list_data)