插入排序
void f(int n)
{
int j,i,key;
for(j=2;j<=n;j++){//n指字符串长度
key=a[j];
i=j-1;
while(i>0&&(a[i]>key)){
a[i+1]=a[i];
i--;
}
a[i+1]=key;
}
}
void f(int n)
{
int j,i,key;
for(j=2;j<=n;j++){//n指字符串长度
key=a[j];
i=j-1;
while(i>0&&(a[i]>key)){
a[i+1]=a[i];
i--;
}
a[i+1]=key;
}
}