Pagini recente » Cod sursa (job #1783765) | Borderou de evaluare (job #2525061) | Cod sursa (job #1077601) | Cod sursa (job #7452) | Cod sursa (job #1151002)
#include <iostream>
#include <cstdio>
#include <fstream>
using namespace std;
int n, v[500005];
int main()
{
ifstream fin("algsort.in");
ofstream fout("algsort.out");
fin>>n;
for (int i=1; i<=n; i++)
fin>>v[i];
for (int i=1; i<n; i++)
for (int j=i+1; j<=n; j++)
if (v[i] > v[j])
swap(v[i], v[j]);
for (int i=1; i<=n; i++)
fout<<v[i]<<" ";
return 0;
}