Cod sursa(job #264481)
Utilizator | Data | 22 februarie 2009 10:55:58 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream.h>
#include <fstream.h>
fstream f("algsort.in",ios::in);
fstream g("algsort.out",ios::out);
long a[501],i,N;
int ok,aux;
int main()
{
f>>N;
for(i=1;i<=N;i++)
f>>a[i];
do{
ok=1;
for(i=1;i<N;i++)
if (a[i]>a[i+1])
{
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=0;
}
}while (ok==0);
for(i=1;i<=N;i++)
g<<a[i]<<" ";
f.close();
g.close();
return 0;
}