冒泡排序:
import random
def bubble_sort(li):
#复杂度O(n**2)
for i in range(len(li)-1): #第i趟
exchange = False
for j in range(len(li)-i-1):
if li[j] > li[j+1]:
li[j] , li[j+1]=li[j+1] , li[j]
exchange = True
if not exchange: #如果其中一趟排序没有发生交换,说明已经有序,可以直接结束算法
return
li = [3,2,4,6,5,9,8,7,1]
#li = [random.randint(0,10000) for i in range(1000)]
print(li)
bubble_sort(li)
print(li)
选择排序:
def select_sort_simple(li):
#缺点:1.创建了两个列表,占内存 ;2复杂度O(n**2)
li_new=[]
for i in range(len(li)):
min_val = min(li)
li_new.append(min_val)
li.remove(min_val)
return li_new
def select_sort(li):
#复杂度O(n**2)
for i in range(len(li)-1): #i是第几趟
min_loc = i
for j in range(i+1 , len(li)):
if li[j] < li[min_loc]:
min_loc = j
li[i] , li[min_loc] = li[min_loc] , li[i]
print(li)
li = [3,2,4,1,5,6,8,7,9]
print(li)
select_sort(li)
插入排序:
def insert_sort(li):
#复杂度为O(n**2)
for i in range(1,len(li)): #i 表示摸到的牌的下标
tmp = li[i]
j = i - 1 #j 指的是手里的牌
while j>=0 and li[j] > tmp:
li[j+1] = li[j]
j -= 1
li[j+1] = tmp
print(li)
li = [3,2,4,1,5,7,9,6,8]
insert_sort(li)
print(li)