Cod sursa(job #249895)
| Utilizator | Data | 29 ianuarie 2009 14:53:27 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream.h>
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{
int i, schimb, n;
long aux, a[11199];
fin>>n;
for(i=0; i<n; i++)
fin>>a[i];
do
{
schimb=0;
for(i=0; i<n-1; i++)
if (a[i]>a[i+1])
{
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
schimb=1;
}
}
while(schimb);
for(i=0; i<n; i++)
fout<<a[i]<<" ";
fin.close();
fout.close();
return 0;
}