- void BubbleSort(int a[], int size)
- {
- int lastSwapPos = 0,lastSwapPosTemp = 0;
- for (int i = 0; i < size - 1; i++)
- {
- lastSwapPos = lastSwapPosTemp;
- for (int j = size - 1; j >lastSwapPos; j--)
- {
- if (a[j - 1] > a[j])
- {
- int temp = a[j - 1];
- a[j - 1] = a[j];
- a[j] = temp;
- lastSwapPosTemp = j;
- }
- }
- if (lastSwapPos == lastSwapPosTemp)
- break;
- }
- }
改进的冒泡排序算法
猜你喜欢
转载自blog.csdn.net/qq_35985044/article/details/78634862
今日推荐
周排行