# 冒泡排序
def mybubble(ls):
flag = True
times = 0
while flag:
flag = False
for i in range(len(ls)-times-1): # 只要遍历没排序的元素
if ls[i]>ls[i+1]:
ls[i],ls[i+1] = ls[i+1],ls[i]
flag = True
times += 1
return ls
时间复杂度