Cod sursa(job #266573)
Utilizator | Data | 25 februarie 2009 20:10:30 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream.h>
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i,j,aux,a[100],sw;
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>a[i];
do{ sw=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;
sw=0;
}
} while(sw==0);
g<<a[i]<<' ';
f.close();
g.close();
return 0;}