#include <iostream>
using namespace std;
int partition(int arr[], int low, int high) {
int pivot = arr[high];
int i = low - 1;
for (int j = low; j < high; j++) {
if (arr[j] < pivot) {
i++;
swap(arr[i], arr[j]);
}
}
swap(arr[i + 1], arr[high]);
return i + 1;
}
void quickSort(int arr[], int low, int high) {
if (low < high) {
int pi = partition(arr, low, high);
quickSort(arr, low, pi - 1);
quickSort(arr, pi + 1, high);
}
}
int main() {
int arr[] = {10, 7, 8, 9, 1, 5};
int n = sizeof(arr) / sizeof(arr[0]);
quickSort(arr, 0, n - 1);
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IHBhcnRpdGlvbihpbnQgYXJyW10sIGludCBsb3csIGludCBoaWdoKSB7CiAgICBpbnQgcGl2b3QgPSBhcnJbaGlnaF07CiAgICBpbnQgaSA9IGxvdyAtIDE7CgogICAgZm9yIChpbnQgaiA9IGxvdzsgaiA8IGhpZ2g7IGorKykgewogICAgICAgIGlmIChhcnJbal0gPCBwaXZvdCkgewogICAgICAgICAgICBpKys7CiAgICAgICAgICAgIHN3YXAoYXJyW2ldLCBhcnJbal0pOwogICAgICAgIH0KICAgIH0KCiAgICBzd2FwKGFycltpICsgMV0sIGFycltoaWdoXSk7CiAgICByZXR1cm4gaSArIDE7Cn0KCnZvaWQgcXVpY2tTb3J0KGludCBhcnJbXSwgaW50IGxvdywgaW50IGhpZ2gpIHsKICAgIGlmIChsb3cgPCBoaWdoKSB7CiAgICAgICAgaW50IHBpID0gcGFydGl0aW9uKGFyciwgbG93LCBoaWdoKTsKICAgICAgICBxdWlja1NvcnQoYXJyLCBsb3csIHBpIC0gMSk7CiAgICAgICAgcXVpY2tTb3J0KGFyciwgcGkgKyAxLCBoaWdoKTsKICAgIH0KfQoKaW50IG1haW4oKSB7CiAgICBpbnQgYXJyW10gPSB7MTAsIDcsIDgsIDksIDEsIDV9OwogICAgaW50IG4gPSBzaXplb2YoYXJyKSAvIHNpemVvZihhcnJbMF0pOwoKICAgIHF1aWNrU29ydChhcnIsIDAsIG4gLSAxKTsKCiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykKICAgICAgICBjb3V0IDw8IGFycltpXSA8PCAiICI7CiAgICBjb3V0IDw8IGVuZGw7CgogICAgcmV0dXJuIDA7Cn0K