冒泡排序
def bubbleSort(arr):
n = len(arr)
# 遍历所有数组元素
for i in range(n):
# Last i elements are already in place
for j in range(0, n-i-1):
if arr[j] > arr[j+1] :
arr[j], arr[j+1] = arr[j+1], arr[j]
选择排序
#选择排序
def select_sort(seq):
n = len(seq)
for i in range(n - 1):
min_idx = i
for j in range(i+1,n):
#如果第一个值大于,第二个值,,,,一次类推
if seq[j] < seq[min_idx]:
#把第二个拿到下一次循环中继续比较
min_idx = j
if min_idx != i:
seq[i].aeq[min_idx] = seq[min_idx],seq[i]
插入排序
#插入排序
def insertion_sort(seq):
n = len(seq)
for i in range(1,n):
#value是第二个小朋友
value = seq[i]
pos = i
#不是第一个小朋友 and 第一个小朋友比第二个大
while pos > 0 and value < seq[pos -1]:
#交换位置 在和前一个继续比较 直到pos = 0
seq[pos] = seq[pos-1]
pos -= 1
seq[pos] = value