选择排序
def selection_sort_v1(lst):
for i in range(len(lst)):
min_index=i
for j in range(i+1,len(lst)):
if lst[j]<lst[min_index]:
min_index=j
lst.insert(i,lst.pop(min_index))
def selection_sort_v2(lst):
for i in range(len(lst)):
min_index=i
for j in range(i+1,len(lst)):
if lst[j]<lst[min_index]:
min_index=j
x=lst[i]
lst[i]=lst[min_index]
lst[min_index]=x
lst=[10,5,8,13,7,4]
selection_sort_v1(lst)
print (lst)
selection_sort_v2(lst)
print (lst)
冒泡排序
def bubble_sort(lst):
top=len(lst)-1
is_exchanged=True
while is_exchanged:
is_exchanged=False
for i in range(top):
if lst[i]>lst[i+1]:
is_exchanged =True
x=lst[i]
lst[i]=lst[i+1]
lst[i+1]=x
top-=1
lst=[10,5,8,13,7,4]
bubble_sort(lst)
print (lst)
转载:https://blog.csdn.net/weixin_45102232/article/details/102059519
查看评论