插入排序

#include<iostream>
#include<string>
using namespace std;
template<typename T>
void insertSort(T* array,int length)
{
T key;
int i,j;
for (i = 1;i < length;i++) //i为已排序好的长度
{
key = array[i];
for (j = i-1 ; j>=0; j--) //和0--(i-1)之间的每个元素进行比较
{
if(key>=array[j])
break;
array[j+1]=array[j];
}
array[j+1]=key;
}
}

int main(){
int a[]={4,5,2,1,4,7,8,8,9,6,2,2,54,4,14};
int b[sizeof(a)/sizeof(*a)];
insertSort(a,15);
for(int i=0;i<15;++i){
cout<<a[i]<<" ";
}
cout<<endl;
system("pause");
return 0;
}