Cod sursa(job #1477715)
| Utilizator | Data | 26 august 2015 20:14:22 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
void selection_sort(int A[], int l, int r)
{
for (int i = l; i < r; ++i)
{
int p = i;
for (int j = i + 1; j <= r; ++j)
if (A[j] < A[p])
p = j;
swap(A[i], A[p]);
}
}
const int MAX_N = 500000 + 1;
int A[MAX_N];
int N;
int main()
{
ifstream in("algsort.in");
ofstream out("algsort.out");
in >> N;
for (int i = 0; i < N; ++i)
in >> A[i];
selection_sort(A, 0, N - 1);
for (int i = 0; i < N; ++i)
out << A[i] << " ";
return 0;
}
