Pagini recente » Cod sursa (job #109170) | Cod sursa (job #2173469) | Cod sursa (job #3312663) | Cod sursa (job #2482253) | Cod sursa (job #3346032)
#include <cstdlib>
#include <ctime>
#include <iostream>
#define NMAX 500000
void merge_sort(int *v, int n)
{
int *w;
if (n < 2)
return;
merge_sort(v, n / 2);
merge_sort(v + n / 2, n - n / 2);
w = new int[n];
for (int i = 0, j = n / 2, k = 0; /* (i < n / 2 || j < n) && */ k < n; ++k)
if (j >= n || (i < n / 2 && v[i] < v[j]))
w[k] = v[i++];
else // i >= n / 2 || (j < n && v[i] >= v[j])
w[k] = v[j++];
for (int i = 0; i < n; ++i)
v[i] = w[i];
delete[] w;
}
int _max_down(int *v, int n, int i)
{
int j = i;
for (int k = 2 * i + 1; k <= 2 * i + 2; ++k)
if (k < n && v[k] > v[j])
j = k;
return j;
}
void heap_sort(int *v, int n)
{
int a;
for (int k = n / 2 - 1; k >= 0; --k) {
for (int i = k, j = _max_down(v, n, i); j != i; i = j, j = _max_down(v, n, i)) {
a = v[i];
v[i] = v[j];
v[j] = a;
}
}
for (--n; n > 0; --n) {
a = v[n];
v[n] = v[0];
v[0] = a;
for (int i = 0, j = _max_down(v, n, i); j != i; i = j, j = _max_down(v, n, i)) {
a = v[i];
v[i] = v[j];
v[j] = a;
}
}
}
void quick_sort(int *v, int n)
{
int k, a;
int m = 1;
if (n < 2)
return;
k = rand() % n;
a = v[n - 1];
v[n - 1] = v[k];
v[k] = a;
for (int i = 0, j = 0; j < n - 1; ++j)
if (v[j] < v[n - 1]) {
a = v[i];
v[i] = v[j];
v[j] = a;
++i;
++m;
}
a = v[n - 1];
v[n - 1] = v[m - 1];
v[m - 1] = a;
quick_sort(v, m - 1);
quick_sort(v + m, n - m);
}
int main()
{
int n;
int v[NMAX];
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
// srand(time(nullptr)); // used by quick sort
std::cin >> n;
for (int i = 0; i < n; ++i)
std::cin >> v[i];
heap_sort(v, n);
for (int i = 0; i < n; ++i)
std::cout << v[i] << ' ';
std::cout << '\n';
return 0;
}