#include <stdio.h>
#include <stdlib.h>
#define MAX_INT 655354
#define NUM 16
void insertSort(int array[],int length);
int main()
{
int array[NUM] = {23,12,3,4,2,3,234,5655,34,123,445,44,3,4,56,78};
int i ;
insertSort(array,NUM);
for(i = 0; i < NUM; ++i )
{
printf("%d ",array[i]);
}
return 0;
}
void insertSort(int array[],int length)
{
int i,j,cur;
for(i = 1;i < length; ++i)
{
cur = array[i];
j = i - 1;
while(j >= 0 && array[j] > cur)
{
array[j + 1] = array[j--];
}
array[j + 1] = cur;
}
}
算法导论-插入排序算法
最新推荐文章于 2016-10-07 21:46:07 发布