#include \n#include \n\nusing namespace std;\n\nint partition(vector& arr, int low, int high) {\n int pivot = arr[high];\n int i = low - 1;\n \n for (int j = low; j < high; j++) {\n if (arr[j] < pivot) {\n i++;\n swap(arr[i], arr[j]);\n }\n }\n \n swap(arr[i + 1], arr[high]);\n return i + 1;\n}\n\nvoid quickSort(vector& arr, int low, int high) {\n if (low < high) {\n int pivotIndex = partition(arr, low, high);\n \n quickSort(arr, low, pivotIndex - 1);\n quickSort(arr, pivotIndex + 1, high);\n }\n}\n\nvoid printArray(const vector& arr) {\n for (int num : arr) {\n cout << num << " ";\n }\n cout << endl;\n}\n\nint main() {\n vector arr = {9, 5, 7, 1, 3, 10, 2, 6, 8, 4};\n int n = arr.size();\n \n cout << "Original array: ";\n printArray(arr);\n \n quickSort(arr, 0, n - 1);\n \n cout << "Sorted array: ";\n printArray(arr);\n \n return 0;\n}
