c++ 模板实现多种排序

//用模板实现排序:冒泡排序,鸡尾酒排序,选择排序

//后续排序持续更新

#include<iostream>

#include<vector>
using namespace std;
//用模版实现排序
//冒泡排序
template<typename T>
void BubbleSort(T b, T e, string com = "<")
{
size_t size = e - b;
bool flag = true;
if (com != "<" && com != ">")
return;
for (int i = 0; i < size - 1; ++i)
{
for (int j = 0;j < size - i - 1;++j)
if (com == "<"? (*(b + j) > *(b + j + 1)):(*(b + j)<*(b + j + 1)))
{
swap(*(b + j), *(b + j + 1));
flag = false;
}
if (flag)
break;
}
}
//鸡尾酒排序
template<typename T>
void CocktailSort(T b,T e,string com = "<")
{
auto left = 0;
auto right = e - b - 1;
if (com != "<" && com != ">")
return;
while (left < right)
{
for (auto i = left; i < right; ++i)
if (com == "<" ? (*(b + i) > *(b + i + 1)) : (*(b + i) < *(b + i + 1)))
{
swap(*(b + i), *(b + i + 1));
}
--right;
for (auto j = right; j > left; --j)
if (com == "<" ? (*(b + j -1) > *(b + j)) : (*(b + j - 1) < *(b + j)))
{
swap(*(b + j), *(b + j - 1));
}
++left;
}
}
//选择排序
template<typename T>
void SelectSort(T b, T e, string com = "<")
{
auto min_max = 1;
auto size = e - b;
for (int i = 0; i < size - 1; ++i)
{
min_max = i;
for (int j = i + 1; j <= size - 1; ++j)
if(com == "<" ? *(b + j) < *(b + min_max):*(b + j)>*(b + min_max))
min_max = j;
if (i != min_max)
swap(*(b + i), *(b + min_max));
}
}
int main()
{
int a[8] = { 5,9,2,4,6,7,8,3 };
vector<int> b = { 1,4,5,2,3,7,8,9,0 };
//BubbleSort(&a[0],&a[8],">");
//BubbleSort(b.begin(),b.end());
//CocktailSort(&a[0], &a[8]);
//CocktailSort(b.begin(), b.end());
SelectSort(&a[0], &a[8]);
SelectSort(b.begin(), b.end());
for (int i = 0; i < 8; ++i)
cout << a[i] << ends;
cout << endl;
for (auto &v : b)
cout << v << ends;
system("pause");
return 0;
}