插入排序(Insertion Sort)
算法思想:每次假设前面的元素都是排序好的,将当前的元素插入到已排序后的序列中。因为前面的元素都是排序的,所以可以使用二分查找的方式插入。时间复杂度为 。
# 插入排序
def insertion_sort(alist):
for i in range(len(alist)):
currentvalue = alist[i]
position = i
while position > 0 and alist[position-1] > alist[position]:
alist[position] = alist[position-1]
position = position - 1
alist[position] = currentvalue
# 二分插入排序
def insertion_sort_binarysearch(a_list):
for index in range(1,len(a_list)):
current_value = a_list[index]
position = index
low = 0
high = index - 1
while low <= high:
mid = (low + high) // 2
if a_list[mid] > current_value:
high = mid - 1
else:
low = mid + 1
while position > low:
a_list[position] = a_list[position - 1]
position = position - 1
a_list[position] = current_value
图像和例子参考了这篇文章,里面有关于算法每部的运行步骤,值得参考。
http://interactivepython.org/courselib/static/pythonds/SortSearch/TheInsertionSort.html