#include<iostream>
using namespace std;
template <class T>
void sort(T s[],int n)
{
int i,j;
T temp;
for(i=1;i<n;i++)
{
j=i;
temp=s[i];
while(j>0&&temp<s[j-1])
{
s[j]=s[j-1];
j--;
}
s[j]=temp;
}
}
template <class T>
void disp(T s[],int n)
{
for(int i=0;i<n;i++)
{
cout<<s[i]<<" ";
}
cout<<endl;
}
void main()
{
int a[]={3,8,2,6,7,1,4,9,5,0};
char b[]={'i','d','a','j','b','f','e','c','g','h'};
cout<<"整数序列:"<<endl;
cout<<"原序列:";
disp(a,10);
sort(a,10);
cout<<"新序列:";
disp(a,10);
cout<<"字符序列:"<<endl;
cout<<"原序列:";
disp(b,10);
sort(b,10);
cout<<"新序列:";
disp(b,10);
}
(四)模板-排序sort
最新推荐文章于 2022-05-06 22:42:28 发布