Pagini recente » Borderou de evaluare (job #1025188) | Borderou de evaluare (job #1867557) | Borderou de evaluare (job #1420820) | Borderou de evaluare (job #2078012) | Cod sursa (job #2913581)
#include <bits/stdc++.h>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
const int NMAX = 500005;
int arr[NMAX];
int n;
int main()
{
f >> n;
for(int i=0;i<n;++i)
f >> arr[i];
for(int i=0;i<n;++i)
{
for(int j=i;j<n;++j)
{
if(i!=j && arr[i] > arr[j])
swap(arr[i],arr[j]);
}
}
for(int i=0;i<n;++i)
g << arr[i] << ' ';
}