Cod sursa(job #261154)
Utilizator | Data | 17 februarie 2009 21:50:34 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream.h>
ifstream f("algsort.in");
ofstream g("algsort.out");
long n,v[5000],i,j,aux;
int main (){
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(v[i]>v[j]){
aux=v[i];
v[i]=v[j];
v[j]=aux;}
for(i=1;i<=n;i++)
g<<v[i];
f.close();
g.close();
return 0;}