算法-排序

 1 def bubb_sort(list):
 2    # 冒泡排序
 3     for i in range(len(list)-1,0,-1):
 4         for j in  range(i):
 5             tmp=list[0]
 6             if list[j]>list[j+1]:
 7                 tmp=list[j+1]
 8                 list[j+1]=list[j]
 9                 list[j]=tmp
10     return list

1 if __name__=="__main__":
2     a=[5,4,3,3,2,1]
3     print(bubb_sort(a))

 

1 def insert_sort(ll):
#插入排序
2     for i in range(1,len(ll)):
3         for j in range(i,0,-1):
4             if ll[j] <ll[j-1]:
5                 tmp=ll[j]
6                 ll[j]=ll[j-1]
7                 ll[j-1]=tmp

1  if __name__=="__main__":
2     a=[6,5,4,3,1,2,3,4]
3     insert_sort(a)
4     print(a)

 

 1 def select_sort(ll):
 2 #选择排序
 3     for i in range(0,len(ll)-1):
 4         tmp_la=ll[0]
 5         num=0
 6         for j in range(1,len(ll)-i):
 7             if tmp_la<ll[j]:
 8                 
 9                 tmp_la=ll[j]
10                 num=j
11         ll[num]=ll[j]
12         ll[j]=tmp_la

1 if __name__=="__main__":
2     a=[6,52,4,2,3,1]
3     select_sort(a)
4     print(a)

 

转载于:https://www.cnblogs.com/Dai-py/p/10820679.html