Cod sursa(job #2285819)
| Utilizator | Data | 19 noiembrie 2018 12:40:33 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[500005];
int main()
{
ifstream fin ("algsort.in");
ofstream fout ("algsort.out");
int n;
fin>>n;
for (int i=0; i<n; i++)
fin>>a[i];
for (int i=0; i<n-1; i++)
for (int j=i+1; j<n; j++)
if (a[i]>a[j])
{
int aux=a[i];
a[i]=a[j];
a[j]=aux;
}
for (int i=0; i<n; i++)
fout<<a[i]<<' ';
return 0;
}
