#include <iostream>
#include <stdlib.h>
#include <time.h>
using namespace std;
template<typename T>//判大
bool Min(T a, T b)
{
cout << " Min(T a, T b)"<< endl;
return a < b;
}
template<>
bool Min<char*>(char* a, char*b)
{
cout << "Min<char*>(char* a, char*b)"<< endl;
return strcmp(a, b) < 0;
}
template<typename T>//判小
bool Max(T a, T b)
{
cout << "Max(T a, T b)"<< endl;
return a > b;
}
template<>
bool Max<char*>(char* a, char*b)
{
cout << "Max<char*>(char* a, char*b)"<< endl;
return strcmp(a, b) > 0;
}
//利用选择排序进行代码演示
template<typename T, typename Pre>
void sort(T* arr, int len, Pre pre)
{
T tmp;
for(int i = 0; i < len; i++)
{
for(int j = i; j < len; j++)
{
if(pre(arr[i], arr[j]))
{
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
}
}
}
int main()
{
srand(time(0));
int arr[10] = {0};
for(int i = 0; i < 10; i++)
{
arr[i] = rand() % 100 + 1;
}
sort(arr, 10, Min<int>);
for(int i = 0; i < 10; i++)
{
cout << arr[i] <<" ";
}
cout << endl;
sort(arr, 10, Max<int>);
for(int i = 0; i < 10; i++)
{
cout << arr[i] <<" ";
}
cout << endl;
return 0;
}