排序2.冒泡排序
#include <bits/stdc++.h>
using namespace std;
void BubbleSort(vector<int>& nums)
{
int len = nums.size();
bool changeFlag = true;
for (int i = 1; i < len && changeFlag; i++)
{
changeFlag = false;
for (int j = 0; j < len - i; j++)
{
if (nums[j] > nums[j + 1])
{
swap(nums[j], nums[j + 1]);
changeFlag = true;
}
}
}
}
int main()
{
vector<int> nums{ -1, 6, 5, 3, 3, 4, 9, 1, 10, 15, 16, 11, 33, 77, 21, 99, 111, 7};
BubbleSort(nums);
for (auto &x : nums)
cout << x << ", ";
cout << endl;
return 0;
}