插入排序
插入排序 图表展示
代码
def insertionSort(alist):
for index in range(1,len(alist)):
current=alist[index]
position=index
while position>0 and alist[position-1]>current:
alist[position]=alist[position-1]
position-=1
alist[position]=current
alist=[52,312,54,7,3,2,56,34,65]
insertionSort(alist)
print(alist)
选择排序
选择排序 图表展示
代码
def selectionSort(alist):
for fillsort in range(len(alist)-1,0,-1):
positionofMax=0
for location in range(1,fillsort+1):
if alist[location]>alist[positionofMax]:
positionofMax=location
temp=alist[fillsort]
alist[fillsort]=alist[positionofMax]
alist[positionofMax]=temp
alist=[52,312,54,7,3,2,56,34,65]
selectionSort(alist)
print(alist)