定义方法:
# 冒泡排序
def sort(list):
length = len(list)
for i in range(0,length-1):
for j in range(0,length-1-i):
if list[j] > list[j+1]:
temp = list[j]
list[j] = list[j+1]
list[j+1] = temp
return list
调用方法:
from sort import sort
if __name__ == '__main__':
list_1 = [2,5,9,6,8,1]
sort(list_1)
# print(aaa)
print('排序后的数组:')
for k in sort(list_1):
print(k)