看了算法导论后写的一个关于插入排序的程序,有缺点的地方欢迎指正
#include <stdio.h>
#include <string.h>
#define MAX 100
void INSERTION_SORT(int A[],int len);
int main(void)
{
int len=0,A[MAX];
while(scanf("%d",&A[len]) != EOF)
{
if(len>=MAX) break;
len++;
}
//len = (sizeof A)/(sizeof A[0]);
INSERTION_SORT(A,len);
for (int i = 0; i < len; i++)
{
printf("%d ",A[i]);
}
return 0;
}
void INSERTION_SORT(int A[],int len)
{
int i,j,key;
for(j=1;j<len;j++)
{
key = A[j];
i = j-1;
while(i>=0 && A[i]>key)
{
A[i+1] = A[i];
i--;
}
A[i+1] = key;
}
}