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