void InsertSort(SqList L){
int i;
for (i=2;i<=L.Length;i++){
if(L.elem[i]<L.elem[i-1]){
L.elem[0]=L.elem[i];
L.elem[i]=L.elem[i-1];
int j;
for (j=i-2;j>0&&L.elem[0]<L.elem[j];j--){
L.elem[j+1]=L.elem[j];
}
L.elem[j+1]=L.elem[0];
}
}
}
11-19
258
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
06-16