1.简单选择排序算法
# include <STDIO.H>
void main()
{
int i,j, arr[] = {23, 90, 9, 25, 16};
for(i=0; i<5; i++)
{
for(j=0; j<5; ++j)
printf("%5d", arr[j]);
printf("\n");
for (j=i+1; j<5; ++j)
{
if(arr[i] > arr[j])
{
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
}
2.选择排序算法的优化
# include <STDIO.H>
void main()
{
int i,j, arr[] = {23, 90, 9, 25, 16};
int min;
for (i=0; i<4; ++i)
{
min = i;
for(j=0; j<5; ++j)
printf("%5d", arr[j]);
printf("\n");
for(j=i+1; j<5; ++j)
{
if (arr[min] > arr[j])
{
min = j;
}
}
if (min != i)
{
int temp = arr[min];
arr[min] = arr[i];
arr[i] = temp;
}
}
for(j=0; j<5; ++j)
printf("%5d", arr[j]);
printf("\n");
}