冒泡排序

稳定排序算法,平均时间复杂度为

def bubble(list):        length = len(list)-1        for i in range(length):                for j in range(length-i):                        if list[j] > list[j+1]:                                temp = list[j]                                list[j] = list[j+1]                                list[j+1] = temp        return list