Cod sursa(job #286550)
| Utilizator | Data | 23 martie 2009 21:46:44 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
unsigned long v[500000];
int main()
{unsigned long n,i,j,aux;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n-1;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]<<" ";
g<<'\n';
f.close();
g.close();
return 0;
}