Bubble sort and its implementation

最新推荐文章于 2021-01-10 20:41:57 发布

beiyeqingteng

最新推荐文章于 2021-01-10 20:41:57 发布

阅读量859

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 (Algorithm) 文章标签： class

本文链接：https://blog.youkuaiyun.com/beiyeqingteng/article/details/5756837

算法 (Algorithm) 专栏收录该内容

113 篇文章

订阅专栏

本文详细介绍了冒泡排序算法的工作原理及实现过程。冒泡排序类似于插入排序，通过不断比较相邻元素并交换位置来对数组进行排序。当较高值的元素位于较低值元素之前时，二者会进行交换，直至整个数组有序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Bubble sort is quite like the insertion sort. In the insertion sort, the left part of the array is always ordered, which is the same in Bubble sort.

In bubble sort, the adjacent elements are compared and swaped if the higher element is larger than the lower element, and the compare-and-swap procedure will stop when the bubble sort reach the upper bound of the unsorted array.

class BubbleSortAlgorithm { public void BubbleSort(int[] array) { bool exchanged = false; // to check whether the array is sorted. for (int i = 1; i < array.Length; i++) { for (int j = array.Length - 1; j >= i; j--) { if (array[j] < array[j - 1]) { exchanged = true; int temp = array[j]; array[j] = array[j - 1]; array[j - 1] = temp; } } if (exchanged == false) { return; } } } }