python代码实现冒泡排序代码其实很简单，具体代码如下所示：
|
1
2
3
4
5
6
7
8
9
10
11
|
代码Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/--> 1 def bubbleSort(numbers):for j in xrange(len(numbers),-1,-1):for i in xrange(0,j-1,1):if numbers[i] > numbers[i+1]:numbers[i],numbers[i+1] = numbers[i+1],numbers[i]print numbersdef main():numbers = [23,12,9,15,6]bubbleSort(numbers)if __name__ == '__main__':main() |
输出结果为
[12, 9, 15, 6, 23]
[9, 12, 6, 15, 23]
[9, 6, 12, 15, 23]
[6, 9, 12, 15, 23]
[6, 9, 12, 15, 23]
[6, 9, 12, 15, 23]
好了，代码到此就给大家介绍完了，希望对大家有所帮助！
