参考算法导论第二章 2.1小结
#include <stdio.h>
#include <stdlib.h>
int data[] = {18, 6, 30, 17, 29};
int main(int argc, char *argv[])
{
int i, j;
int key;
for(j=1; j<(sizeof(data)/sizeof(data[0])); j++) //使用sizeof接收数组个数
{
key=data[j];
i=j-1;
while((i>-1)&&(data[i]>key))
{
data[i+1] = data[i];
i--;
}
data[i+1]=key;
}
printf("size = %d\n", (sizeof(data)/sizeof(data[0])) );
for(j=0; j<(sizeof(data)/sizeof(data[0]));j++)
{
printf("%d\n", data[j]);
}
system("PAUSE");
return 0;
}