不解释,直接上代码
#include <stdio.h>
void insert(int arry[], int iIndex)
{
int iSaved = arry[iIndex];
int iPos = iIndex-1;
while(iPos>=0 && iSaved<arry[iPos])
{
arry[iPos+1] = arry[iPos];
--iPos;
}
arry[iPos+1] = iSaved;
}
int main()
{
const int iarrynum = 10;
int arry[] = {10,9,8,7,6,5,4,3,2,1};
printf("old order:\n");
for(int i=0; i<iarrynum; ++i)
{
printf("%d\t",arry[i]);
}
printf("\n");
for(int i=1; i<iarrynum; ++i)
{
insert(arry,i);
}
printf("new order:\n");
for(int i=0; i<iarrynum; ++i)
{
printf("%d\t",arry[i]);
}
printf("\ndone.\n");
}
做算法还是要写纯C,gcc编译不通过,将for中的变量提到外面。
如果是基于指针的插入排序,只需将参数转换为指针形式,并将比较函数作为回调函数
void sortPointer(void** ar,int index, int(*cmp)(const void*, const void*)){
void* saved = ar[index];
int iPos = index-1;
while(iPos>=0 && cmp(ar[iPos],saved)>0)
{
ar[iPos+1] = ar[iPos];
iPos--;
}
ar[iPos+1] = saved;
}