Pagini recente » Cod sursa (job #294010) | Cod sursa (job #1696673) | Cod sursa (job #2644338) | Cod sursa (job #1253770) | Cod sursa (job #1738522)
#include <cstdlib>
#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 pivot = left + rand() % (right - left);
int i = left, j = right;
for (; i < j; ) {
if (arr[i] < arr[pivot]) {
++ i;
}
if (arr[j] > arr[pivot]) {
-- j;
}
if (arr[i] >= arr[pivot] && arr[j] <= pivot) {
swap(arr[i], arr[j]);
++ i;
-- j;
}
}
// return pivot position
return i;
}
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 *a = new int[n];
for (int i = 0; i < n; ++ i) {
scanf("%d", &a[i]);
}
qsort(a, 0, n - 1);
printArray(a, n);
delete [] a;
return 0;
}