#include <stdio.h>
#include <stdlib.h>
void Sort()
{
int data[10] = {
2, 3, 5, 65, 25, 64, 32, 75, 23, 0
};
for (int n = 0; n < 10; n++)
{
printf("%d ", data[n]);
}
printf("/n");
int temp = 0;
for (int i = 0; i < 10; i++)
{
int z = i;
for (int j = i + 1; j < 10; j++)//找出未排序最小的值的下标，放在z中
{
if (data[j] < data[z])
{
z = j;
}
}
if (z > i)//if z > i 交换data[z] data[i]
{
if (data[i] > data[z])
{
temp = data[i];
data[i] = data[z];
data[z] = temp;
}
}
}
for (int k = 0; k < 10; k++)
{
printf("%d ", data[k]);
}
}
int main()
{
Sort();
return 0;
}
