Python在线学习插入排序算法思路
插入排序就是每一步都将一个待排数据插入到已经排序的数据中的适当位置，直到全部数据插入完毕。
算法实现
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 |
# Filename : lean001.py # author by : www.py40.com #python插入排序算法 def insert_sort(a): for i in range(len(a)): min_index = i for j in range(i+1,len(a)): if a[min_index] > a[j]: min_index = j tmp = a[i] a[i] = a[min_index] a[min_index] = tmp print(str(a)) a = [1,45,12,4,56,3,12] insert_sort(a) print("insert_sort: " + str(a)) |
运行结果
|
1 2 3 4 5 6 7 8 9 |
C:\Users\Administrator>E:\python\learn\lean001.py [1, 45, 12, 4, 56, 3, 12] [1, 3, 12, 4, 56, 45, 12] [1, 3, 4, 12, 56, 45, 12] [1, 3, 4, 12, 56, 45, 12] [1, 3, 4, 12, 12, 45, 56] [1, 3, 4, 12, 12, 45, 56] [1, 3, 4, 12, 12, 45, 56] insert_sort: [1, 3, 4, 12, 12, 45, 56] |
未经允许不得转载：Python在线学习 » Python-插入排序