快速排序

练习内容

#include <iostream>\nusing namespace std;\n\nint partition(int 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[