Python冒泡排序算法

         冒泡排序, 一种简单的排序算法.重复的访问要排序数列,如果他们的顺序错误,就把位置交换过来,直到没有需要交换.这个算法的由来是因为越小的元素会经由交换会慢慢的浮到数列的顶端.

 

冒泡算法的运用如下:

1. 比较相邻的元素。如果第一个比第二个大，就交换他们两个。
2. 对每一对相邻元素作同样的工作，从开始第一对到结尾的最后一对。这步做完后，最后的元素会是最大的数。
3. 针对所有的元素重复以上的步骤，除了最后一个。
4. 持续每次对越来越少的元素重复上面的步骤，直到没有任何一对数字需要比较。

 

Python代码如下:

 

# coding=utf-8 import random class Bubble: def main(self): arr_list = [each for each in range(10)] random.shuffle(arr_list) print("Raw list: ", arr_list) self.sort_arr(arr_list) def sort_arr(self, arr): for j in range(len(arr) - 1): if arr[j] > arr[j + 1]: self.swap(arr, j) print("Process list: ", arr) self.sort_arr(arr) @staticmethod def swap(arr, j): arr[j], arr[j + 1] = arr[j + 1], arr[j] if __name__ == '__main__': bubble = Bubble() bubble.main()

 

结果如下:

 

Raw list: [4, 6, 9, 1, 2, 5, 7, 3, 0, 8] Process list: [4, 6, 1, 9, 2, 5, 7, 3, 0, 8] Process list: [4, 1, 6, 9, 2, 5, 7, 3, 0, 8] Process list: [1, 4, 6, 9, 2, 5, 7, 3, 0, 8] Process list: [1, 4, 6, 2, 9, 5, 7, 3, 0, 8] Process list: [1, 4, 2, 6, 9, 5, 7, 3, 0, 8] Process list: [1, 2, 4, 6, 9, 5, 7, 3, 0, 8] Process list: [1, 2, 4, 6, 5, 9, 7, 3, 0, 8] Process list: [1, 2, 4, 5, 6, 9, 7, 3, 0, 8] Process list: [1, 2, 4, 5, 6, 7, 9, 3, 0, 8] Process list: [1, 2, 4, 5, 6, 7, 3, 9, 0, 8] Process list: [1, 2, 4, 5, 6, 3, 7, 9, 0, 8] Process list: [1, 2, 4, 5, 3, 6, 7, 9, 0, 8] Process list: [1, 2, 4, 3, 5, 6, 7, 9, 0, 8] Process list: [1, 2, 3, 4, 5, 6, 7, 9, 0, 8] Process list: [1, 2, 3, 4, 5, 6, 7, 0, 9, 8] Process list: [1, 2, 3, 4, 5, 6, 0, 7, 9, 8] Process list: [1, 2, 3, 4, 5, 0, 6, 7, 9, 8] Process list: [1, 2, 3, 4, 0, 5, 6, 7, 9, 8] Process list: [1, 2, 3, 0, 4, 5, 6, 7, 9, 8] Process list: [1, 2, 0, 3, 4, 5, 6, 7, 9, 8] Process list: [1, 0, 2, 3, 4, 5, 6, 7, 9, 8] Process list: [0, 1, 2, 3, 4, 5, 6, 7, 9, 8] Process list: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]