- 冒泡排序
def sortBubble(array):
'''冒泡排序'''
for j in range(len(array)):
for i in range(len(array)-1-j):
if array[i] > array[i+1]:
array[i], array[i+1] = array[i+1], array[i]
A = [2,3,5,6,7,23,12,1]
sortBubble(A)
print(A)
结果:
- 选择排序
def sortSelection(array):
'''冒泡排序'''
for j in range(len(array)):
min = array[j]
k = j
for i in range(j, len(array)):
if array[i] < min:
min = array[i]
k = i
array[k], array[j] = array[j], array[k]
list = [3, 5, 1, 4, 32, 1]
sortSelection(list)
print(list)
结果
- 快速排序
def qsort(list):
'''快速排序'''
if len(list) < 2:
return list
else:
mid = list[0]
del list[0]
right, left = [], []
for x in list:
if x >= mid:
right.append(x)
elif x < mid:
left.append(x)
return qsort(left) + [mid] + qsort(right)
num = [3, 1, 3, 7, 9, 3, 4, 6]
print(qsort(num))
结果
- 直接插入排序
def insert_sort(array):
'''直接插入排序'''
for i in range(1, len(array)):
temp = array[i]
j = i - 1
print(array)
while j >= 0:
if temp < array[j]:
array[j+1] = array[j]
j = j - 1
else:
array[j+1] = temp
break
array[j + 1] = temp
array = [2, 1,3, 4, 1, 3,5]
insert_sort(array)
结果