Cod sursa(job #247080)
| Utilizator |  Vlad Schnakovszki shnako |
Data | 22 ianuarie 2009 08:52:24 |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream.h>
ifstream f("algsort.in");
ofstream g("algsort.out");
long n, i, j, aux;
int v[50001];
int main(void)
{
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;
}