python插入排序算法

# -*- coding:utf-8 -*-


def insertsort(list):
n = len(list)
for i in range(1, n):
for j in range(i, 0, -1):
if list[j] < list[j-1]:
list[j], list[j-1] = list[j-1], list[j]
else:
break
if __name__ == '__main__':
list = [52, 43, 75]
print '原始队列：%s' %list
insertsort(list)

print '排序后队列：%s' %list

输出结果

原始队列：[52, 43, 75]
排序后队列：[43, 52, 75]
[Finished in 0.2s]