Cod sursa(job #2308542)
| Utilizator | Data | 27 decembrie 2018 12:39:45 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main ()
{
int a[500003];
int i, j, N, aux;
fin >> N;
for (i = 0; i < N; i++)
fin >> a[i];
for (i = 0; i < N-1; 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 = 0; i < N; i++)
fout << a[i] << " ";
return 0;
}
