Cod sursa(job #1912076)
Utilizator | Data | 7 martie 2017 22:57:01 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int i, n, x[500000];
bool ok;
int main()
{
fin>>n;
for(i=1; i<=n; ++i) fin>>x[i];
do
{
ok=1;
for(i=1; i<n; ++i)
{
if(x[i]>x[i+1])
{
ok=0;
swap(x[i], x[i+1]);
}
}
}while(!ok);
for(i=1; i<=n; ++i) fout<<x[i]<<" ";
fout<<"\n";
return 0;
}