冒泡排序，是指计算机的一种排序方法，它的时间复杂度为O（n^2），虽然不及堆排序、快速排序的O（nlogn，底数为2），但是有两个优点：1.“编程复杂度”很低，很容易写出代码；2.具有稳定性，这里的稳定性是指原序列中相同元素的相对顺序仍然保持到排序后的序列，而堆排序、快速排序均不具有稳定性。不过，一路、二路归并排序、不平衡二叉树排序的速度均比冒泡排序快，且具有稳定性，但速度不及堆排序、快速排序。-Bubble sort is a sorting method of the computer, its time complexity is O (n ^ 2), though not as heapsort, quicksort O (nlogn, base 2), but has two advantages: 1 . " programming complexity"　is very low, it is easy to write code　2 with stability, where stability is the primary sequence of elements in the same relative order remains the sorted sequence, and heap sort, quick sort are does not have stability. However, all the way, Road merge sort, binary tree sort of uneven pace faster than bubble sort, and with stability, but the speed is less than heap sort, quick sort.