[DnA] 排序算法

冒泡：

def BubbleSort(li:[]):
    length = len(li)
    for i in range(0,length):
        for j in range(0,length - i - 1):
            if li[j] > li[j+1]:
                tmp = li[j]
                li[j] = li[j+1]
                li[j+1] = tmp