Cod sursa(job #1915911)
Utilizator | Data | 8 martie 2017 23:05:18 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int i,p,n,j,x[1000001],ok,aux;
int main ()
{
f>>n;
for(i=1;i<=n;i++) f>>x[i];
do{
ok=1;
for(i=1;i<n;i++)
{
if(x[i]>x[i+1])
{
ok=0;
aux=x[i];
x[i]=x[i+1];
x[i+1]=aux;
}
}
}while(ok==0);
for(i=1;i<=n;i++) g<<x[i]<<" ";
return 0;
}