Pagini recente » Cod sursa (job #2287482) | Cod sursa (job #2053397) | Cod sursa (job #1654857) | Cod sursa (job #402379) | Cod sursa (job #1738562)
#include <cstdio>
#include <cstdlib>
using namespace std;
void swap(int &a, int &b) {
int aux = a;
a = b;
b = aux;
}
void printArray(int* arr, int n) {
for (int i = 0; i < n; ++ i) {
printf("%d ", arr[i]);
}
printf("\n");
}
int partition(int* arr, int left, int right) {
int pivotIndex = left + rand() % (right - left + 1);
swap(arr[pivotIndex], arr[right]);
int begin = left;
for (int j = left; j < right; ++ j) {
if (arr[j] <= arr[right]) {
swap(arr[j], arr[begin]);
++ begin;
}
}
swap(arr[begin], arr[right]);
return begin;
}
void qsort(int* arr, int left, int right) {
if (right <= left) {
return;
}
int i = partition(arr, left, right);
qsort(arr, left, i - 1);
qsort(arr, i + 1, right);
}
int main() {
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
int n;
scanf("%d", &n);
int *arr = new int[n];
for (int i = 0; i < n; ++ i) {
scanf("%d", &arr[i]);
}
qsort(arr, 0, n - 1);
printArray(arr, n);
delete[] arr;
return 0;
}