面試常見算法題---冒泡排序python

兩個循環判斷相鄰數組是否交換

class Solution():
    def Bubble_sort(self, list):
        for i in range(len(list)-1, 0, -1):
            for j in range(i):
                if list[j] > list[j+1]:
                    list[j], list[j+1] = list[j+1], list[j]
        return list