Cod sursa(job #1276352)
| Utilizator | Data | 26 noiembrie 2014 11:11:04 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[500001];
int main()
{
int n, i, j, x;
ifstream fin("algsort.in");
fin >> n;
for (i = 1; i <= n; i++)
fin >> a[i];
fin.close();
for (i = 1; i < n; i++)
for (j = i + 1; j <= n; j++)
if (a[i] > a[j])
{
x = a[i];
a[i] = a[j];
a[j] = x;
}
ofstream fout("algsort.out");
for (i = 1; i <= n; i++)
fout << a[i] << " ";
fout.close();
return 0;
}
