冒泡排序原理:
两两相邻元素之间的比较,如果前者大于后者,则交换。重复地走过要排序的数列,一次比较两个元素,如果他们的顺序错误就把他们交换过来。走访数列的工作是重复地进行直到没有再需要交换,也就是说该数列已经排序完成。
因此此排序属于交换排序一类,同类的还有现在最常用的排序方法:快速排序;
详细解释:
# -*- coding:utf-8 -*-
__author__ = 'ZHONGZHIKUN408'
data_set = [ 9,1,22,31,45,3,6,2,11 ]
loop_count = 0
for j in range(len(data_set)):
print "****j = %d****" %j # 格式化输出的格式
for i in range(len(data_set) - j- 1):
print "i = %d" %i
# -1是因为每次比对的都是i与i+1,不减1的话,最后一次对比会超出list 获取范围
# -j是因为,每一次大loop就代表排序好了一个最大值,放在了列表最后面,下次loop就不用再运算已经排序好了的值了
if data_set[i] > data_set[i+1]: # 假如序号i小的,就是第一个和第二个比较,第一个大的话,就switch
tmp = data_set[i]
data_set[i] = data_set[i+1]
data_set[i+1] = tmp
print ("switch %d and %d" %(data_set[i],data_set[i+1]))
loop_count += 1 # loop_count 只是计数的,比较的次数
print(data_set) # 打印出交换一次的
# print(data_set)
# print(data_set)
print("loop times", loop_count)
# ****** j = 0;i in range(8) i从0-7的时候,一共比较了8次 这一次把最大的数沉到了最后面,下次处理第二大的
# [1, 9, 22, 31, 45, 3, 6, 2, 11] i=0 第一次i 和 i+1,就是比较0 和 1 位置的
# [1, 9, 22, 31, 45, 3, 6, 2, 11] i=1 比较 1 和2 位置的
# [1, 9, 22, 31, 45, 3, 6, 2, 11] i=2
# [1, 9, 22, 31, 45, 3, 6, 2, 11] i=3
# [1, 9, 22, 31, 3, 45, 6, 2, 11] i=4
# [1, 9, 22, 31, 3, 6, 45, 2, 11] i=5
# [1, 9, 22, 31, 3, 6, 2, 45, 11] i=6
# [1, 9, 22, 31, 3, 6, 2, 11, 45] i=7
# ****** j = 1 (j 是需要从0-8 比较7次) 这次i从0-6,一共比较7次
# [1, 9, 22, 31, 3, 6, 2, 11, 45]
# [1, 9, 22, 31, 3, 6, 2, 11, 45]
# [1, 9, 22, 31, 3, 6, 2, 11, 45]
# [1, 9, 22, 3, 31, 6, 2, 11, 45]
# [1, 9, 22, 3, 6, 31, 2, 11, 45]
# [1, 9, 22, 3, 6, 2, 31, 11, 45]
# [1, 9, 22, 3, 6, 2, 11, 31, 45]
# ****j = 0****
# i = 0
# switch 1 and 9
# [1, 9, 22, 31, 45, 3, 6, 2, 11]
# i = 1
# [1, 9, 22, 31, 45, 3, 6, 2, 11]
# i = 2
# [1, 9, 22, 31, 45, 3, 6, 2, 11]
# i = 3
# [1, 9, 22, 31, 45, 3, 6, 2, 11]
# i = 4
# switch 3 and 45
# [1, 9, 22, 31, 3, 45, 6, 2, 11]
# i = 5
# switch 6 and 45
# [1, 9, 22, 31, 3, 6, 45, 2, 11]
# i = 6
# switch 2 and 45
# [1, 9, 22, 31, 3, 6, 2, 45, 11]
# i = 7
# switch 11 and 45
# [1, 9, 22, 31, 3, 6, 2, 11, 45]
# ****j = 1****
# i = 0
# [1, 9, 22, 31, 3, 6, 2, 11, 45]
# i = 1
# [1, 9, 22, 31, 3, 6, 2, 11, 45]
# i = 2
# [1, 9, 22, 31, 3, 6, 2, 11, 45]
# i = 3
# switch 3 and 31
# [1, 9, 22, 3, 31, 6, 2, 11, 45]
# i = 4
# switch 6 and 31
# [1, 9, 22, 3, 6, 31, 2, 11, 45]
# i = 5
# switch 2 and 31
# [1, 9, 22, 3, 6, 2, 31, 11, 45]
# i = 6
# switch 11 and 31
# [1, 9, 22, 3, 6, 2, 11, 31, 45]
程序步骤描述:
设置两个嵌套的for循环去遍历,第一个为遍历列表长度 for j in range(len(data_set)),实现把全部元素都冒泡一次,嵌套的for循环目的是通过比较,把最大的一个元素沉到最底,所以这个for遍历的长度为(len(data_set) - j- 1),因为每次可以不遍历最后最大的那个。
1.比较相邻的元素。如果第一个比第二个大,就交换他们两个。
2.对每一对相邻元素作同样的工作,从开始第一对到结尾的最后一对。在这一点,最后的元素应该会是最大的数。
针对所有的元素重复以上的步骤,除了最后一个。
持续每次对越来越少的元素重复上面的步骤,直到没有任何一对数字需要比较。
简洁版本:
# -*- coding:utf-8 -*-
__author__ = 'ZHONGZHIKUN408'
data_set = [ 9,1,22,31,45,3,6,2,11 ]
for i in range(len(data_set)):
for j in range(len(data_set) - i- 1):
if data_set[j] > data_set[j+1]:
tmp = data_set[j]
data_set[j] = data_set[j+1]
data_set[j+1] = tmp
----------------------------------------------------------
下面的例子很简洁,但是是选择排序,不是插入排序
容易混淆的地方,这是一个选择排序,先选出了最小的,然后排在第一
#Author:zzk
#coding=utf-8
# 冒泡排序
def bubble_sort(lists):
for i in range(0, len(lists)):
print 'i=%d' %i
for j in range(i+1, len(lists)):
print 'j=%d' %j
if lists[i] > lists[j]:
lists[i], lists[j] = lists[j], lists[i]
print (lists)
return lists
lists = [2,5,1,7,22,6,0,33,12]
print bubble_sort(lists)
# i=0
# j=1
# [2, 5, 1, 7, 22, 6, 0, 33, 12]
# j=2
# [1, 5, 2, 7, 22, 6, 0, 33, 12]
# j=3
# [1, 5, 2, 7, 22, 6, 0, 33, 12]
# j=4
# [1, 5, 2, 7, 22, 6, 0, 33, 12]
# j=5
# [1, 5, 2, 7, 22, 6, 0, 33, 12]
# j=6
# [0, 5, 2, 7, 22, 6, 1, 33, 12]
# j=7
# [0, 5, 2, 7, 22, 6, 1, 33, 12]
# j=8
# [0, 5, 2, 7, 22, 6, 1, 33, 12]
# i=1
# j=2
# [0, 2, 5, 7, 22, 6, 1, 33, 12]
# j=3
# [0, 2, 5, 7, 22, 6, 1, 33, 12]
# j=4
# [0, 2, 5, 7, 22, 6, 1, 33, 12]
# j=5
# [0, 2, 5, 7, 22, 6, 1, 33, 12]
# j=6
# [0, 1, 5, 7, 22, 6, 2, 33, 12]
# j=7
# [0, 1, 5, 7, 22, 6, 2, 33, 12]
# j=8
# [0, 1, 5, 7, 22, 6, 2, 33, 12]
# i=2
# j=3
# [0, 1, 5, 7, 22, 6, 2, 33, 12]
# j=4
# [0, 1, 5, 7, 22, 6, 2, 33, 12]
# j=5
# [0, 1, 5, 7, 22, 6, 2, 33, 12]
# j=6
# [0, 1, 2, 7, 22, 6, 5, 33, 12]
# j=7
# [0, 1, 2, 7, 22, 6, 5, 33, 12]
# j=8
# [0, 1, 2, 7, 22, 6, 5, 33, 12]
# i=3
# j=4
# [0, 1, 2, 7, 22, 6, 5, 33, 12]
# j=5
# [0, 1, 2, 6, 22, 7, 5, 33, 12]
# j=6
# [0, 1, 2, 5, 22, 7, 6, 33, 12]
# j=7
# [0, 1, 2, 5, 22, 7, 6, 33, 12]
# j=8
# [0, 1, 2, 5, 22, 7, 6, 33, 12]
# i=4
# j=5
# [0, 1, 2, 5, 7, 22, 6, 33, 12]
# j=6
# [0, 1, 2, 5, 6, 22, 7, 33, 12]
# j=7
# [0, 1, 2, 5, 6, 22, 7, 33, 12]
# j=8
# [0, 1, 2, 5, 6, 22, 7, 33, 12]
# i=5
# j=6
# [0, 1, 2, 5, 6, 7, 22, 33, 12]
# j=7
# [0, 1, 2, 5, 6, 7, 22, 33, 12]
# j=8
# [0, 1, 2, 5, 6, 7, 22, 33, 12]
# i=6
# j=7
# [0, 1, 2, 5, 6, 7, 22, 33, 12]
# j=8
# [0, 1, 2, 5, 6, 7, 12, 33, 22]
# i=7
# j=8
# [0, 1, 2, 5, 6, 7, 12, 22, 33]
# i=8
# [0, 1, 2, 5, 6, 7, 12, 22, 33]
这个可以很清楚的看出思路,就是i的第一次循环,就是从最顶端的第一个数开始,和下面的比较,直到最大的一个沉下去。
这个应该是选择排序
https://my.oschina.net/u/1587469/blog/725120