Cod sursa(job #2913581)
Utilizator | Data | 15 iulie 2022 11:55:49 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#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] << ' ';
}