Cod sursa(job #900160)
| Utilizator | Data | 28 februarie 2013 18:00:10 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,i,aux,ord;
fin >> n;
int a[n];
for(i=1;i<=n;i++)
fin >> a[i];
do
{
ord=1;
for(i=1;i<=n-1;i++)
if(a[i]>a[i+1])
{
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ord=0;
}
}while(ord==0);
for(i=1;i<=n;i++)
fout << a[i] << " ";
fin.close();
fout.close();
return 0;
}
