已知 数组Python冒泡法

import math
def mao(ls):
n=len(ls)
temp=0
for j in range(n-1):
count=0
for i in range(n-1-j):
if ls[i]>ls[i+1]:
ls[i],ls[i+1]=ls[i+1],ls[i]
count+=1
if count==0:
break

ls=[9,6,8,1]
mao(ls)
print(“the later”)
for i in range(len(ls)):
print("%d" %ls[i])