排序算法之冒泡算法的一个问题

代码呢？

代码如下
def bubbleSort1(alist):
exchanges = True
while exchanges:
exchanges = False
size=len(alist)
a=size//2
b=size%2
for i in range(a):
if alist[2*i]>alist[2*i+1]:
exchanges = True
temp = alist[2*i]
alist[2 * i] = alist[2 * i + 1]
alist[2*i+1] = temp
for i in range(a-1+b):
if alist[2*i+1]>alist[2*i+2]:
exchanges = True
temp = alist[2*i+1]
alist[2 * i+1] = alist[2 * i + 2]
alist[2*i+2] = temp
alist = [54,26,93,17,77,31,44,55,20]
bubbleSort1(alist)
print(alist)

或者这样
def bubbleSort2(alist):
exchanges = True
while exchanges:
exchanges = False
size=len(alist)
for i in range(size):
if i%2==0 and i+1<=size-1:
if alist[i]>alist[i+1]:
exchanges = True
temp = alist[i]
alist[i] = alist[i+1]
alist[i+1] = temp
for i in range(size):
if i%2==1 and i+1<=size-1:
if alist[i]>alist[i+1]:
exchanges = True
temp = alist[i]
alist[i] = alist[i+1]
alist[i+1] = temp
alist = [54,26,93,17,77,31,44,55,20]
bubbleSort2(alist)
print(alist)

一样的，冒泡可能还更快一些

你的冒泡排序写的是不对的。先比较012345，再比较01234，0123，012，把大的数字往后搬。