函数重载练习

源代码

#include <iostream>

using namespace std;
//使用函数重载实现数组的排序

void Sort(int[], int len);
void Sort(float[], int len);//重载,函数名相同,参数列表(特征标)不同
void Sort(double[], int len);

void show(int[], int len);
void show(float[], int len);//重载,函数名相同,参数列表(特征标)不同
void show(double[], 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;
}
//整型数组排序
void Sort(int nums[], int len)
{
    int 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;
            }
        }
    }
}
//单精度浮点型数组排序
void Sort(float nums[], int len)
{
    int 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;
            }
        }
    }
}
//双精度浮点型数组排序
void Sort(double nums[], int len)
{
    int 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;
            }
        }
    }
}
//整型数组元素显示
void show(int nums[], int len)
{
  for(int i = 0; i < len; i++)
  {
      cout << nums[i];
      cout << "  ";
  }
  cout << "\n";
}
//单精度浮点型元素显示
void show(float nums[], int len)
{
  for(int i = 0; i < len; i++)
  {
      cout << nums[i];
      cout << "  ";
  }
  cout << "\n";
}
//双精度浮点型元素显示
void show(double nums[], int len)
{
  for(int i = 0; i < len; i++)
  {
      cout << nums[i];
      cout << "  ";
  }
  cout << "\n";
}

运行结果