Pagini recente » Cod sursa (job #1282964) | Borderou de evaluare (job #1257720) | Cod sursa (job #2490868) | Cod sursa (job #295220) | Cod sursa (job #1912082)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int i, n, x[500001], j;
bool ok;
int main()
{
fin>>n;
for(i=1; i<=n; ++i) fin>>x[i];
for(i=1; i<n; ++i)
{
for(j=i+1; j<=n; ++j)
{
if(x[j]<x[i]) swap(x[j], x[i]);
}
}
for(i=1; i<=n; ++i) fout<<x[i]<<" ";
fout<<"\n";
return 0;
}