#include <stdio.h>
#include <ASSERT.H>
typedef int elemType;
void insertSort(elemType *arr,int arrSize)
{
assert(arr);
int i,j,k;
elemType tempval;
for (i=0;i<arrSize;++i)
{
j=i-1;
k=0;
tempval = arr[i];
while(j>=0 && tempval<arr[j])
{
arr[i-k] = arr[j];
--j;
++k;
}
arr[++j] = tempval;
}
}
void printArr(elemType *arr,int arrSize)
{
int i=0;
while (i<arrSize)
{
printf("%d ",arr[i++]);
}
printf("\n");
}
int main(void)
{
elemType arr[]={1,5,4,2,6,9,2,3,11,0,56,232,561,2,6,11,2,76};
int size = sizeof(arr)/sizeof(elemType);
printf("排序前:");
printArr(arr,size);
insertSort(arr,size);
printf("排序后:");
printArr(arr,size);
return 0;
#include <ASSERT.H>
typedef int elemType;
void insertSort(elemType *arr,int arrSize)
{
assert(arr);
int i,j,k;
elemType tempval;
for (i=0;i<arrSize;++i)
{
j=i-1;
k=0;
tempval = arr[i];
while(j>=0 && tempval<arr[j])
{
arr[i-k] = arr[j];
--j;
++k;
}
arr[++j] = tempval;
}
}
void printArr(elemType *arr,int arrSize)
{
int i=0;
while (i<arrSize)
{
printf("%d ",arr[i++]);
}
printf("\n");
}
int main(void)
{
elemType arr[]={1,5,4,2,6,9,2,3,11,0,56,232,561,2,6,11,2,76};
int size = sizeof(arr)/sizeof(elemType);
printf("排序前:");
printArr(arr,size);
insertSort(arr,size);
printf("排序后:");
printArr(arr,size);
return 0;
}
结果:
关于assert()函数的用法和解释,请参考:http://www.cnblogs.com/ggzss/archive/2011/08/18/2145017.html