Cod sursa(job #520067)
| Utilizator | Data | 7 ianuarie 2011 13:03:48 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream.h>
int n , i , V[500001] , aux , j;
int main ()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>V[i];
}
for(i=1;i<=n;i++)
{
for(j=i;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;
}