项目41--排序函数模板

　　已知

<code class="hljs cs has-numbering" style="display: block; padding: 0px; color: inherit; box-sizing: border-box; font-family: 'Source Code Pro', monospace;font-size:undefined; white-space: pre; border-top-left-radius: 0px; border-top-right-radius: 0px; border-bottom-right-radius: 0px; border-bottom-left-radius: 0px; word-wrap: normal; background: transparent;"><span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">void</span> Sort(<span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">int</span> a[],<span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">int</span> size);
<span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">void</span> Sort(<span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">double</span> a[],<span class="hljs-keyword" style="color: rgb(0, 0, 136); box-sizing: border-box;">int</span> size);</code><ul class="pre-numbering" style="box-sizing: border-box; position: absolute; width: 50px; top: 0px; left: 0px; margin: 0px; padding: 6px 0px 40px; border-right-width: 1px; border-right-style: solid; border-right-color: rgb(221, 221, 221); list-style: none; text-align: right; background-color: rgb(238, 238, 238);"><li style="box-sizing: border-box; padding: 0px 5px;">1</li><li style="box-sizing: border-box; padding: 0px 5px;">2</li></ul><ul class="pre-numbering" style="box-sizing: border-box; position: absolute; width: 50px; top: 0px; left: 0px; margin: 0px; padding: 6px 0px 40px; border-right-width: 1px; border-right-style: solid; border-right-color: rgb(221, 221, 221); list-style: none; text-align: right; background-color: rgb(238, 238, 238);"><li style="box-sizing: border-box; padding: 0px 5px;">1</li><li style="box-sizing: border-box; padding: 0px 5px;">2</li></ul>

是一个函数模板的两个实例，其功能是将数组a中的前size个元素按从小到大顺序排列。试设计这个函数模板。

#include <iostream>
using namespace std;
void Sort(int a[],int size);
void Sort(double a[],int size);
int main()
{
    int a[10]={9,5,7,3,1,4,8,6,10,2};
    Sort(a,5);
    for(int i=0;i<10;i++)
        cout<<a[i]<<"  ";
    cout<<endl;
    double b[10]={9,5,7,3,1,4,8,6,10,2};
    Sort(b,8);
    for(int i=0;i<10;i++)
        cout<<b[i]<<"  ";
    return 0;
}
void Sort(int a[],int size)
{
    for(int i=0;i<size;++i)
        for(int j=i+1;j<size;++j)
    {
        int temp;
        if(a[i]>a[j])
        {
            temp=a[i];
            a[i]=a[j];
            a[j]=temp;
        }
    }
}
void Sort(double a[],int size)
{
    for(int i=0;i<size;++i)
        for(int j=i+1;j<size;++j)
    {
        double temp;
        if(a[i]>a[j])
        {
            temp=a[i];
            a[i]=a[j];
            a[j]=temp;
        }
    }
}

运行结果：