Cod sursa(job #461998)
Utilizator | Data | 9 iunie 2010 15:19:52 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
long i,n,p=1,aux,x[500001] ;
f>>n;
for(i=1;i<=n;i++) f>>x[i];
while(p)
{
p=0;
for(i=1;i<n;i++)
{
if(x[i]>x[i+1])
{
aux=x[i];
x[i]=x[i+1];
x[i+1]=aux;
p=1;
}
}
}
for(i=1;i<=n;i++) g<<x[i]<<' ';
f.close();
g.close();
return 0;
}