#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
void BubbleSort(vector<int> & vec)
{
int length = vec.size();
if (length <= 1)
{
return ;
}
else
{
for (int i = 0; i < length - 1; ++i)
{
for (int j = 0; j < length - i - 1; ++j)
{
if (vec[j] > vec[j + 1])
{
swap(vec[j], vec[j + 1]);
}
}
}
}
return ;
}
int main()
{
vector<int> vec = {4, 5, 3, 2, 1};
for (int i = 0; i < vec.size(); ++i)
{
cout << vec[i] << '\t';
}
cout << endl;
BubbleSort(vec);
for (int i = 0; i < vec.size(); ++i)
{
cout << vec[i] << '\t';
}
cout << endl;
}
void BubbleSort(vector<int> & vec)
{
int length = vec.size();
if (length <= 1)
{
return ;
}
else
{
for (int i = 0; i < length - 1; ++i)
{
bool isSorted = true;
for (int j = 0; j < length - i - 1; ++j)
{
if (vec[j] > vec[j + 1])
{
isSorted = false;
swap(vec[j], vec[j + 1]);
}
}
if (isSorted)
{
break;
}
}
}
return ;
}
void BubbleSort(vector<int> & vec)
{
int length = vec.size();
if (length <= 1)
{
return ;
}
else
{
int sortBorder = length - 1;
int lastExchangeIndex = 0;
while (sortBorder > 0)
{
bool isSorted = true;
for (int i = 0; i < sortBorder; ++i)
{
if (vec[i] > vec[i + 1])
{
swap(vec[i], vec[i + 1]);
isSorted = false;
lastExchangeIndex = i;
}
}
if (isSorted)
{
break;
}
sortBorder = lastExchangeIndex;
}
}
}