python算法练习之冒泡排序法:
在这里插入代码片
def bullon_sort(alist):
n = len(alist)
for i in range(0, n-1):
for i in range(0, n-i-1):
if alist[i] >= alist[i+1]:
alist[i], alist[i+1] = alist[i+1], alist[i]
return alist
if __name__ == "__main__":
alist = list(map(int, input().split()))
print(bullon_sort(alist))
算法复杂度:O(N2)