Cod sursa(job #2157262)
Utilizator | Data | 9 martie 2018 14:10:16 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
int main()
{
fstream f("algsort.in");
ofstream g("algsort.out");
int n, i, j;
long a[500001], aux;
f>>n;
for(i=1;i<=n;i++)
f>>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++)
g<<a[i]<<" ";
return 0;
}