class BubbleSort:
def sort(self, a):
# 外循环决定一共走几趟
for i in range(0, len(a) - 1):
# 内循环,决定每趟走几次
for j in range(0, len(a) - 1):
if a[j] > a[j + 1]:
temp = a[j + 1]
a[j + 1] = a[j]
a[j] = temp
return a
if __name__ == '__main__':
a = [3, 2, 1]
print(a)
b = BubbleSort().sort(a)
print(b)
结果
[3, 2, 1]
[1, 2, 3]
冒泡排序
最新推荐文章于 2022-01-08 18:13:14 发布