1.冒泡排序
代码如下:
方法1:
array = [1,2,3,6,5,4]
for i in range(len(array)) [::-1] :
for j in range(i):
if array[j] > array[j + 1]:
array[j], array[j + 1] = array[j + 1], array[j]
print(array)
for i in range(len(array)) [::-1] :
for j in range(i):
if array[j] > array[j + 1]:
array[j], array[j + 1] = array[j + 1], array[j]
print(array)
执行结果:
![](https://i-blog.csdnimg.cn/blog_migrate/aaa0ff0d8fa8258ac78306e5cfa1766b.png)
方法2:
def bubble_sort(lists):
count = len(lists)
for i in range(0, count):
for j in range(i + 1, count):
if lists[i] > lists[j]:
lists[i], lists[j] = lists[j], lists[i]
# print(lists)
return lists
print(bubble_sort([3, 2, 1, 5, 4, 3]))
count = len(lists)
for i in range(0, count):
for j in range(i + 1, count):
if lists[i] > lists[j]:
lists[i], lists[j] = lists[j], lists[i]
# print(lists)
return lists
print(bubble_sort([3, 2, 1, 5, 4, 3]))
执行结果:
![](https://i-blog.csdnimg.cn/blog_migrate/20158ed3560980e308b8bddb28ad2cdf.png)