//记住适合位置i的下标,把它换过来
#include <stdio.h>
void swap(int *a, int* b)
{
int tmp = 0;
tmp = *a;
*a = *b;
*b = tmp;
}
//比较次数n(n-1)/2,交换次数n-1,时间复杂度为O(n2),但是比冒泡的效率高。因为冒泡的比较和交换次数之和是n(n-1)
void SelectSort(int *L)
{
int i, j;
int min;
for (i = 0; i < 10; i++)
{
min = i;
for (j = i + 1; j < 10; j++)
{
if (L[j] < L[min])
min = j;
}
if (min != i)
swap(&L[i], &L[min]);
}
}
int main()
{
int L[10] = { 3,2,5,6,8,1,9,4,7,0 };
int i = 0;
for (; i < 10; i++)
{
printf("%d ", L[i]);
}
printf("\n");
SelectSort(L);
for (i = 0; i < 10; i++)
{
printf("%d ", L[i]);
}
printf("\n");
return 0;
}