C++ 容器实现快速排序：单函数高效代码示例

#include \n#include \n\nusing namespace std;
\nint Partition(vector& arr, int low, int high) {\n int pivot = arr[high];\n int i = low - 1;
\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\nvoid QuickSort(vector& arr, int low, int high) {\n if (low < high) {\n int pivot = Partition(arr, low, high);
\n QuickSort(arr, low, pivot - 1);\n QuickSort(arr, pivot + 1, high);\n }\n}\n\nint main() {\n vector arr = {9, 5, 7, 3, 2, 1, 6, 8, 4};
\n QuickSort(arr, 0, arr.size() - 1);
\n cout << "Sorted array: ";\n for (int num : arr) {\n cout << num << " ";\n }\n cout << endl;
\n return 0;
}