Pagini recente » Cod sursa (job #1586130) | Cod sursa (job #2667943) | Cod sursa (job #2960807) | Cod sursa (job #31011) | Cod sursa (job #2608924)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n, i, j, aux, v[500000];
fin >> n;
for (i = 0; i < n; i++)
fin >> v[i];
for (i = 0; i < n; i++)
for (j = i + 1; j < n; j++)
if (v[i] > v[j])
{
aux = v[i];
v[i] = v[j];
v[j] = aux;
}
for (i = 0; i < n; i++)
fout << v[i] << ' ';
fin.close();
fout.close();
return 0;
}