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