#include<iostream>
using namespace std;
template<typename T>
void mySort(T arr[], int n){
for (int i = 0; i < n; i++)
{
int max_pos = i;
for (int j = i+1; j < n; j++)
{
if(arr[max_pos] < arr[j]){
max_pos = j;
}
}
if(max_pos!=i){
T temp = arr[i];
arr[i] = arr[max_pos];
arr[max_pos] = temp;
}
}
}
template<typename T>
void printArr(T arr[], int n){
for (int i = 0; i < n; i++)
{
cout << arr[i];
}
cout << endl;
}
int main(){
char a[] = "abcdef";
int n = sizeof(a)/sizeof(a[0]);
mySort(a, n);
printArr(a,n);
int b[] = {1,2,3,4,5};
n = sizeof(b)/sizeof(b[0]);
mySort(b, n);
printArr(b,n);
}
【c++学习】模板函数
猜你喜欢
转载自blog.csdn.net/weixin_40293999/article/details/132817470