Cod sursa(job #414931)
| Utilizator | Data | 10 martie 2010 18:42:13 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int main(){
long x[500000],n,i,ok,cop,aux;
ifstream fi("algsort.in");
ofstream fo("algsort.out");
fi>>n;
for (i=0;i<n;i++)
fi>>x[i];
cop=n;
do {
ok=0;
for (i=0;i<cop-1;i++)
if (x[i]>x[i+1]) {aux=x[i];
x[i]=x[i+1];
x[i+1]=aux;
ok=1;
}
cop--;}
while (ok==1);
for (i=0;i<n;i++)
fo<<x[i]<<" ";
fi.close();
fo.close();
return 0;
}
