Python实现排序算法

Posted 2020-10-22 薛定谔的猫

一.冒泡排序

 

def bubbleSort(alist):
	for passnum in range(len(alist) - 1,0,-1):
		for i in range(passnum):
			if alist[i] > alist[i+1]:
				temp = alist[i]
				alist[i] = alist[i+1]
				alist[i+1] = temp
alist = [1,3,5,2,4,6,8,7]
bubbleSort(alist)
print(alist)

 

 

短冒泡排序(效率更高):

def shortBubbleSort(alist):
	exchanges = True
	passnum = len(alist) - 1
	while passnum > 0 and exchanges:
		exchanges = False
		print(‘ww‘)
		for i in range(passnum):
			if alist[i] > alist[i+1]:
				print(alist[i])
				print(‘xx‘)
				exchanges = True
				temp = alist[i]
				alist[i] = alist[i+1]
				alist[i+1] = temp
		passnum = passnum - 1 
alist = [9,2,4,3,5,1,8,7]
shortBubbleSort(alist)
print(alist)

　　

二.