>>>#插入排序算法
>>> def insertionSort(seq):
... length=len(seq)
... for i in range(1,length):
... tmp=seq[i]
... for j in range(i,0,-1):
... if seq[j-1]>tmp:
... seq[j]=seq[j-1]
... else:
... j+=1
... break
... seq[j-1]=tmp
...
>>> if __name__=='__main__':
... seq=[8,6,4,9,7,3,2,-4,0,-100,99]
... insertionSort(seq)
... print(seq)
...
[-100, -4, 0, 2, 3, 4, 6, 7, 8, 9, 99]
>>> def insertionSort(seq):
... length=len(seq)
... for i in range(1,length):
... tmp=seq[i]
... for j in range(i,0,-1):
... if seq[j-1]>tmp:
... seq[j]=seq[j-1]
... else:
... j+=1
... break
... seq[j-1]=tmp
...
>>> if __name__=='__main__':
... seq=[8,6,4,9,7,3,2,-4,0,-100,99]
... insertionSort(seq)
... print(seq)
...
[-100, -4, 0, 2, 3, 4, 6, 7, 8, 9, 99]
>>>