a = [1,3,5,4,3,6,9,8]
l = len(a)
def bubbleSort(a):
for i in range(l-1):
for j in range(l-i-1):
if(a[j]>a[j+1]):
t = a[j]
a[j] = a[j+1]
a[j+1] = t
return a
ans = bubbleSort(a)
print(ans)
python 冒泡排序
最新推荐文章于 2022-04-10 12:32:22 发布