Cod sursa(job #1912082)
Utilizator | Data | 7 martie 2017 22:58:43 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#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;
}