Cod sursa(job #1506422)
Utilizator | Data | 20 octombrie 2015 17:25:09 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long long n,a[500001],i,j,aux;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++)f>>a[i];
for(i=1;i<=n-1;i++){
for(j=i+1;j<=n;j++){
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
}
for(i=1;i<=n;i++)g<<a[i]<<" ";
}