冒泡排序（Bubble Sort），是一种计算机科学领域的较简单的排序算法。

它重复地走访过要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。走访数列的工作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。

这个算法的名字由来是因为越小的元素会经由交换慢慢“浮”到数列的顶端，故名。

由于冒泡排序简洁的特点，它通常被用来对于计算机程序设计入门的学生介绍算法的概念。

-Bubble sort (Bubble Sort), is a field of computer science is relatively simple sorting algorithm.

It repeatedly visited numbers to be sorted out, a comparison of two elements, if they put them in the wrong order switched over. Visited the series work is repeatedly performed until no longer need to exchange, ie the sum of the already sorted completed.

Origin of the name of this algorithm is because the smaller the elements slowly through the exchange of "float" to the top of the series, hence the name.

Because the characteristics of simple bubble sort, which is often used for introductory computer programming introduces students to the concept of the algorithm.