Cod sursa(job #877226)
| Utilizator | Data | 12 februarie 2013 18:08:04 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n;
int main()
{
ifstream fin("algsort.in");
ofstream fout("algsort.out");
fin>>n;
long long a[n];
for (int i=1; i<=n; i++)
{
fin>>a[i];
}
int aux;
for (int i=1; i<=n; i++)
for (int j=i; j<=n; j++)
{
if(a[i]>a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
}
for (int i=1; i<=n; i++)
fout<<a[i]<<' ';
fin.close();
fout.close();
return 0;
}
