请实现快排。

当然！下面是用C++实现快速排序算法的示例代码： “`cpp #include <iostream> #include <vector> int partition(std::vector<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++; std::swap(arr[i], arr[j]); } } std::swap(arr[i + 1], arr[high]); return i + 1; } void quickSort(std::vector<int>& arr, int low, int high) { if (low < high) { int pivotIdx = partition(arr, low, high); quickSort(arr, low, pivotIdx – 1); quickSort(arr, pivotIdx + 1, high); } } void printArray(const std::vector<int>& arr) { for (int num : arr) { std::cout << num << " "; } std::cout << std::endl; } int main() { std::vector<int> arr = {9, 5, 1, 8, 3, 2, 7}; std::cout << "Original Array: "; printArray(arr); quickSort(arr, 0, arr.size() – 1); std::cout << "Sorted Array: "; printArray(arr); return 0; } “`</int></int></int></int></vector></iostream>

48:59