文章展示了如何使用Python实现冒泡排序、选择排序和插入排序这三种基础排序算法。冒泡排序通过不断交换相邻逆序元素实现，选择排序每次找到最小（大）元素放到已排序部分的末尾，插入排序则通过比较将元素插入到已排序部分的合适位置。
冒泡排序
def bubble_sort():
# find the max number
numbers = [4, 3, 5, 12, 4, 9, 6, 7]
for i in range(len(numbers)-1, 0, -1):
for j in range(i):
if numbers[j] > numbers[j+1]:
numbers[j], numbers[j+1] = numbers[j+1], numbers[j]
print(numbers)选择排序
def select_sort():
# find the minimum
numbers = [4, 3, 5, 12, 4, 9, 6, 7]
for i in range(len(numbers)-1):
for j in range(i+1, len(numbers)):
if numbers[i] > numbers[j]:
numbers[i], numbers[j] = numbers[j], numbers[i]
print(numbers)插入排序
def insert_sort():
numbers = [4, 3, 5, 12, 4, 9]
# 保证0~i有序
for i in range(1, len(numbers)):
for j in range(i, 0, -1):
if numbers[j] >= numbers[j - 1]:
break
else:
numbers[j - 1], numbers[j] = numbers[j], numbers[j - 1]
print(numbers)
扫一扫
1万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
