基本排序算法(冒泡，选择（希尔），插入，快速，归并，堆，二分查找)

冒泡排序↓

def swap(L,a,b):
    L[a],L[b] = L[b], L[a]


def bubboSort1(array):
    for i in range(0, len(array)):
        for j in range(i+1, len(array)):
            if array[i] > array[j]:
                swap(array,i,j)
    return array


def bubboSort2(array):
    for i in range(0, len(array)):
        for j in range(0,len(array)-1-i):
            if array[j] > array[j+1]:
                swap(array, j, j+1)
    return arraydef swap(L,a,b):
    L[a],L[b] = L[b], L