Cod sursa(job #718466)
| Utilizator | Data | 20 martie 2012 20:26:20 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int a[100],n,i,aux,m,o;
fstream f("algsort.in",ios::in);
fstream g("algsort.out",ios::out);
f>>n;
for(i=1;i<=n;i++)
cin>>a[i];
m=n;
do {
o=1;
for(i=1;i<m;i++)
if(a[i]>a[i+1])
{
o=0;
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
}
m--;
}
while(!o);
for(i=1;i<=n;i++)
g<<a[i]<<" ";
f.close();
g.close();
return 0;
}