2022-09-20
2022-09-19 本文已影响0人
木马音响积木
三个简单的排序
la= [12233, 2, 4, 7, 11, 6,8,9,34,45,56,67,78,79,99,12,13,14,23,24]
def swap(a,b):la[a],la[b]= la[b],la[a]
#冒泡排序
def pao(la):
n=len(la)
for i in range(n):
f=1
for j in range(n-1-i):
if la[j] >la[j+1]:
swap(j,j+1)
f=0
if f:
break
pao(la)
print(la)
la= [12233, 2, 4, 7, 11, 6,8,9,34,45,56,67,78,79,99,12,13,14,23,24]
#选择排序
def select(la):
n =len(la)
for i in range(n-1):
index =i
for j in range(i+1,n):
if la[j] <la[index]:
index =j
swap(i,index)
select(la)
print(la)
la= [12233, 2, 4, 7, 11, 6,8,9,34,45,56,67,78,79,99,12,13,14,23,24]
#插入排序
def insert(la):
n=len(la)
for i in range(1,n):
j=i
t=la[j]
while j and la[j-1] > t:
la[j]=la[j-1]
j-=1
la[j]=t
insert(la)
print(la)
