20180927_Python练习题-五：经典冒泡算法：利用for循环，完成a = [1, 7, 4, 89, 34, 2, 55, 32, 23, 10]的冒泡排序。

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
# 题目五：经典冒泡算法：利用for循环，完成a = [1, 7, 4, 89, 34, 2, 55, 32, 23, 10]的冒泡排序。
# 冒泡排序：小的排前面，大的排后面。排序最终使得数组中的这几个数字按照从小到大的顺序排序
# 冒泡的概念：1、相邻的两个元素，依次进行比较；
#
2、一般最多比较n-1趟，n是元素的个数。
a = [1, 7, 4, 89, 34, 2, 55, 32, 23, 10]
for i in range(len(a)-1):
print("第{0}次冒泡：".format(i + 1))
for j in range(len(a) - 1 - i):
if a[j] > a[j + 1]:
# change = a[j]
# a[j] = a[j + 1]
# a[j + 1] = change
a[j], a[j + 1] = a[j + 1], a[j]
# Python中实现两个数的互换
print("i={0}，j={1}
{2}".format(i, j, a))
else:
print("i={0}，j={1}
{2}".format(i, j, a))
continue
print("冒泡数字为：{0}".format(a[len(a)-1-i]) + "n")
print("最后排序结果：{0}".format(a))
# 第1次冒泡：
# i=0，j=0
[1, 7, 4, 89, 34, 2, 55, 32, 23, 10]
# i=0，j=1
[1, 4, 7, 89, 34, 2, 55, 32, 23, 10]
# i=0，j=2
[1, 4, 7, 89, 34, 2, 55, 32, 23, 10]
# i=0，j=3
[1, 4, 7, 34, 89, 2, 55, 32, 23, 10]
# i=0，j=4
[1, 4, 7, 34, 2, 89, 55, 32, 23, 10]
# i=0，j=5
[1, 4, 7, 34, 2, 55, 89, 32, 23, 10]
# i=0，j=6
[1, 4, 7, 34, 2, 55, 32, 89, 23, 10]
# i=0，j=7
[1, 4, 7, 34, 2, 55, 32, 23, 89, 10]
# i=0，j=8
[1, 4, 7, 34, 2, 55, 32, 23, 10, 89]
# 冒泡数字为：89
#
# 第2次冒泡：
# i=1，j=0
[1, 4, 7, 34, 2, 55, 32, 23, 10, 89]
# i=1，j=1
[1, 4, 7, 34, 2, 55, 32, 23, 10, 89]
# i=1，j=2
[1, 4, 7, 34, 2, 55, 32, 23, 10, 89]
# i=1，j=3
[1, 4, 7, 2, 34, 55, 32, 23, 10, 89]
# i=1，j=4
[1, 4, 7, 2, 34, 55, 32, 23, 10, 89]
# i=1，j=5
[1, 4, 7, 2, 34, 32, 55, 23, 10, 89]
# i=1，j=6
[1, 4, 7, 2, 34, 32, 23, 55, 10, 89]
# i=1，j=7
[1, 4, 7, 2, 34, 32, 23, 10, 55, 89]
# 冒泡数字为：55
#
# 第3次冒泡：
# i=2，j=0
[1, 4, 7, 2, 34, 32, 23, 10, 55, 89]
# i=2，j=1
[1, 4, 7, 2, 34, 32, 23, 10, 55, 89]
# i=2，j=2
[1, 4, 2, 7, 34, 32, 23, 10, 55, 89]
# i=2，j=3
[1, 4, 2, 7, 34, 32, 23, 10, 55, 89]
# i=2，j=4
[1, 4, 2, 7, 32, 34, 23, 10, 55, 89]
# i=2，j=5
[1, 4, 2, 7, 32, 23, 34, 10, 55, 89]
# i=2，j=6
[1, 4, 2, 7, 32, 23, 10, 34, 55, 89]
# 冒泡数字为：34
#
# 第4次冒泡：
# i=3，j=0
[1, 4, 2, 7, 32, 23, 10, 34, 55, 89]
# i=3，j=1
[1, 2, 4, 7, 32, 23, 10, 34, 55, 89]
# i=3，j=2
[1, 2, 4, 7, 32, 23, 10, 34, 55, 89]
# i=3，j=3
[1, 2, 4, 7, 32, 23, 10, 34, 55, 89]
# i=3，j=4
[1, 2, 4, 7, 23, 32, 10, 34, 55, 89]
# i=3，j=5
[1, 2, 4, 7, 23, 10, 32, 34, 55, 89]
# 冒泡数字为：32
#
# 第5次冒泡：
# i=4，j=0
[1, 2, 4, 7, 23, 10, 32, 34, 55, 89]
# i=4，j=1
[1, 2, 4, 7, 23, 10, 32, 34, 55, 89]
# i=4，j=2
[1, 2, 4, 7, 23, 10, 32, 34, 55, 89]
# i=4，j=3
[1, 2, 4, 7, 23, 10, 32, 34, 55, 89]
# i=4，j=4
[1, 2, 4, 7, 10, 23, 32, 34, 55, 89]
# 冒泡数字为：23
#
# 第6次冒泡：
# i=5，j=0
[1, 2, 4, 7, 10, 23, 32, 34, 55, 89]
# i=5，j=1
[1, 2, 4, 7, 10, 23, 32, 34, 55, 89]
# i=5，j=2
[1, 2, 4, 7, 10, 23, 32, 34, 55, 89]
# i=5，j=3
[1, 2, 4, 7, 10, 23, 32, 34, 55, 89]
# 冒泡数字为：10
#
# 第7次冒泡：
# i=6，j=0
[1, 2, 4, 7, 10, 23, 32, 34, 55, 89]
# i=6，j=1
[1, 2, 4, 7, 10, 23, 32, 34, 55, 89]
# i=6，j=2
[1, 2, 4, 7, 10, 23, 32, 34, 55, 89]
# 冒泡数字为：7
#
# 第8次冒泡：
# i=7，j=0
[1, 2, 4, 7, 10, 23, 32, 34, 55, 89]
# i=7，j=1
[1, 2, 4, 7, 10, 23, 32, 34, 55, 89]
# 冒泡数字为：4
#
# 第9次冒泡：
# i=8，j=0
[1, 2, 4, 7, 10, 23, 32, 34, 55, 89]
# 冒泡数字为：2
#
# 最后排序结果：[1, 2, 4, 7, 10, 23, 32, 34, 55, 89]