码迷,mamicode.com
首页 > 编程语言 > 详细

Python实现排序算法

时间:2018-01-31 22:18:24      阅读:197      评论:0      收藏:0      [点我收藏+]

标签:pre   bsp   change   als   pass   div   python   gpo   short   

一.冒泡排序

 

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)

  

二.

 

Python实现排序算法

标签:pre   bsp   change   als   pass   div   python   gpo   short   

原文地址:https://www.cnblogs.com/wangxiayun/p/8394662.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!