Cod sursa(job #348950)
| Utilizator | Data | 17 septembrie 2009 17:41:35 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream.h>
ifstream fin("algsort.in");
ofstream fout("algsort.out");
long int n,a[500010];
void citire()
{long i;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
}
void afisare()
{long i;
for(i=1;i<=n;i++)
fout<<a[i]<<" ";
}
int main()
{typedef enum{DA,NU} boolean;
boolean gata;
long q=n,j,aux;
citire();
do{gata=DA;
for(j=1;j<=q;j++)
if(a[j]>a[j+1])
{gata=NU;
aux=a[j];
a[j]=a[j+1];
a[j+1]=aux;
}
q--;
}while(gata==NU);
afisare();
fin.close();
fout.close();
return 0;
}
