Bubble sort and its implementation

iteye_6233

于 2010-07-23 07:27:00 发布

阅读量72

点赞数

本文详细介绍了冒泡排序算法的工作原理及实现过程。冒泡排序类似于插入排序，通过不断比较相邻元素并交换位置来将较大的元素逐渐移到数组的一端。文章通过具体的C#代码示例展示了冒泡排序算法的具体实现。

摘要生成于 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; } } } }