目录
排序方法
冒泡排序
def bubble(alist):
for j in range(len(alist)-1):
for i in range(0,len(alist)-1):
if alist[i]>alist[i+1]:
alist[i],alist[i+1]=alist[i+1],alist[i]
插入排序
def insert (alist):
n = len(alist)
for i in range(0,n):
for j in range(i,-1,-1):
if j ==0:
break
elif alist[j-1]<alist[j]:
alist[j-1],alist[j]=alist[j],alist[j-1]
else:break
选择排序
def select(alist):
n = len (alist)
for j in range(n-1):
min = j
for i in range(j+1,n):
if alist[min]>alist[i]:
min = i
alist[j],alist[min]=alist[min],alist[j]