Cod sursa(job #877925)
| Utilizator | Data | 13 februarie 2013 14:32:11 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main ()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
long long N[500000];
int n,i,j,aux;
f>>n;
for (i=1;i<=n;i++)
f>>N[i];
for (i=1;i<=n;i++)
for (j=i;j<=n;j++)
{
if(N[i]>N[j])
{
aux=N[i];
N[i]=N[j];
N[j]=aux;
}
}
for (int i=1;i<=n;i++)
g<<N[i]<<' ';
return 0;
}
