Cod sursa(job #262273)
| Utilizator |  Andrei Tudora Dj_Andrei |
Data | 19 februarie 2009 10:57:19 |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream.h>
ifstream f("algsort.in");
ofstream g("algsort.out");
long n,v[5000],i,j,aux,sw;
int main (){
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
do{ sw=0;
for(i=1;i<n;i++)
if(v[i]>v[i+1]){
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
sw++;}}while(sw!=0);
for(i=1;i<=n;i++)
g<<v[i];
f.close();
g.close();
return 0;} 