2020-09-27
冒泡排序#coding:utf-8def duble_sort(alist):“冒泡排序”n=len(alist)for j in range(0,n-1):count = 0for i in range(0,n-1-j):if alist[i]>alist[i+1]:alist[i],alist[i+1] =alist[i+1], alist[i]count+=1if count0:returnif name"main":li=[1,2,3,4,5]print(li)
原创
2020-09-27 23:25:36 ·
105 阅读 ·
0 评论