排序都不需要~简单的一道水题~
#include <iostream>
using namespace std;
void Find(int b[], int n)
{
int k = 0, flag = 0;
int temp = b[0];
for(k = 0; k < n; ++k)
if(temp > b[k])
{
temp = b[k];
flag = k;
}
if(flag)
{
b[flag] = b[0];
b[0] = temp;
}
}
int main()
{
int n;
while(cin >> n)
{
if(n == 0) break;
else
{
int i;
int a[101];
for(i = 0; i < n; ++i)
cin >> a[i];
Find(a, n);
for(i = 0; i < n-1; ++i)
cout << a[i] << " ";
cout << a[n-1] << endl;
}
}
return 0;
}