函数模板

对比一下函数重载那一篇

程序

#include <iostream>

using namespace std;
//使用函数模板实现数组的排序

template<typename T_Sort> void Sort(T_Sort[], int len);
template<typename T_show> void show(T_show[], int len);

int main()
{
    int iNums[] = {56, 54, 12, 89, 43};
    float fNums[] = {78.0f, 5.7f, 42.8f, 99.1f};
    double dNums[] = {78.9, 23.6, 77.8, 98.5, 33.3};

    cout << "排序前\n";
    show(iNums,sizeof(iNums)/sizeof(int));
    cout << "排序后\n";
    Sort(iNums,sizeof(iNums)/sizeof(int));
    show(iNums,sizeof(iNums)/sizeof(int));
    cout << "*****************************\n";
    cout << "排序前\n";
    show(fNums,sizeof(fNums)/sizeof(float));
    cout << "排序后\n";
    Sort(fNums,sizeof(fNums)/sizeof(float));
    show(fNums,sizeof(fNums)/sizeof(float));
    cout << "*****************************\n";
    cout << "排序前\n";
    show(dNums,sizeof(dNums)/sizeof(double));
    cout << "排序后\n";
    Sort(dNums,sizeof(dNums)/sizeof(double));
    show(dNums,sizeof(dNums)/sizeof(double));
    return 0;
}
//数组排序函数模板
template<typename T_Sort>
void Sort(T_Sort nums[], int len)
{
    T_Sort temp;//注意此处temp的数据类型
    for(int i = 0; i < len-1; i++)
    {
        for(int j = 0; j < len-1-i; j++)
        {
            if(nums[j] > nums[j+1])
            {
                temp = nums[j];
                nums[j] = nums[j+1];
                nums[j+1] = temp;
            }
        }
    }
}

//数组元素显示函数模板
template<typename T_show>
void show(T_show nums[], int len)
{
  for(int i = 0; i < len; i++)
  {
      cout << nums[i];
      cout << "  ";
  }
  cout << "\n";
}

运行结果