#include
typedef struct
{
int r[11];
int length;
}SqList;
void InsertSort (SqList *L)
{
int i, j;
for (i = 2; i < L->length; i++)
{
if (L->r[i] < L->r[i - 1])
{
L->r[0] = L->r[i];
for (j = i - 1;L->r[j] > L->r[0]; j--)
L->r[j + 1] = L->r[j];
L->r[j + 1] = L->r[0];
}
}
}
int main()
{
SqList list;
int i;
list.length = 11;
for (i = 1; i < 11; i++)
{
scanf ("%d", &list.r[i]);
//getchar();
}
InsertSort(&list);
for (i = 1; i < 11; i++)
printf ("%d ", list.r[i]);
return 0;
}
来自 “ ITPUB博客 ” ,链接:http://blog.itpub.net/25361369/viewspace-720119/,如需转载,请注明出处,否则将追究法律责任。
转载于:http://blog.itpub.net/25361369/viewspace-720119/