#include<iostream>
using namespace std;
template <class T>void insertSort(T *a,int num)
{
int i,j;
T key;
for(j=1;j<num;++j)
{
key=a[j];
i=j-1;
while(i>=0&&a[i]>key)
{
a[i+1]=a[i];
--i;
}
a[i+1]=key;
}
}
template<class T>void print(T *a,int num)
{
for(int i=0;i<num;++i)
cout<<a[i]<<ends;
}
int main()
{
int a[] ={5,2,4,6,1,3}; //char a[]="HelloWorld!";
int num = sizeof(a)/sizeof(a[0]);
insertSort(a,num);
print(a,num);
return 0;
}
insertSort
最新推荐文章于 2020-05-10 18:25:43 发布