# /usr/bin/python
# -*- coding: utf8 -*-
##############
#冒泡排序
##############
list_wait_deal = [9, 5, 3, 2, 7, 6, 4, 3, 8]
count = len(list_wait_deal)
for i in range(1, count):
#print (i)
flag = False
for j in range(0, count - i):
if list_wait_deal[count - j - 1] <= list_wait_deal[count - j - 2]:
init_min = list_wait_deal[count - j - 1]
list_wait_deal[count - j - 1] = list_wait_deal[count - j - 2]
list_wait_deal[count - j - 2] = init_min
flag = True
#print (flag)
if not flag:
#print (list_wait_deal)
break
print (list_wait_deal)
初学Python:冒泡算法-BubbleSort
猜你喜欢
转载自blog.csdn.net/bingozb/article/details/98474724
今日推荐
周排行