Python之冒泡排序

何为冒泡排序及其原理，请参考：https://www.cnblogs.com/bigdata-stone/p/10464243.html

以下为python的写法：

list = [56,12,1,8,345,10,100,22,7,78,333,-8,0,-12,101]

def sortport():
    for i in range(len(list)-1):
        for j in range(len(list)-1-i):
            if list[j] > list[j+1]:
                list[j],list[j+1] = list[j+1],list[j]
    print(list)

sortport()