#O(n^2) 
def insertionSort(alist):
	for index in range(1,len(alist)):
		currentvalue=alist[index]
		position=index
		while position>0 and alist[position-1]>currentvalue:
			alist[position]=alist[position-1] #移位操作
			position=position-1
		alist[position]=currentvalue
