#include <bits/stdc++.h>
#define N 1000
int main()
{
//输入数组
int n = 0;
int i = 0;
int mid;
int arr[N] = { 0 };
scanf("%d", &n);
for (i = 0; i < n; i++)
{
scanf("%d", &arr[i]);
}
//排序
for (int k = 0; k < n - 1; k++)
{
mid = k;
for (i = k + 1; i < n; i++)
{
if (arr[i] < arr[mid])
{
mid = i;
}
}
if (mid != k)
{
int temp = arr[mid];
arr[mid] = arr[k];
arr[k] = temp;
}
}
for (i = 0; i < n; i++)
{
printf("%d ", arr[i]);
}
return 0;
}
上机调试一下就明白了