Cod sursa(job #1554262)
| Utilizator | Data | 21 decembrie 2015 11:03:42 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,i,j,a[500005],m,maxim,aux,x;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
for(i=1;i<=n;i++)
{
for(j=i+1;j<=n;j++)
{
if(a[i]>a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
}
}
for(i=1;i<=n;i++)
{
fout<<a[i]<<" ";
}
return 0;
}
