void BubbleSort(int *a, int n)
{
int i, low, high;
low = 0;
high = n - 1;
while(low<high){
for (i = low; i < high; ++i){
if (a[i]>a[i + 1])
swap(a + i, a + i + 1);
}
--high;
for (i = high; i>low; --i){
if (a[i] < a[i - 1])
swap(a+i,a+i-1);
}
++low;
}
}
冒泡排序的改进:一次同时冒一个大泡,一个小泡
最新推荐文章于 2025-08-01 11:59:27 发布
