Pagini recente » Borderou de evaluare (job #1285821) | Cod sursa (job #394616) | Cod sursa (job #429441) | Cod sursa (job #7024) | 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;
}