快排的实现方式多种多样，如下是其中的一种方法。

一般不会手撕快排：

#include #include #include using namespace std;int partition(vector& 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[j], arr[i]); } } swap(arr[i+1], arr[high]); return i+1;}void quickSort(vector& arr, int low, int high) { if (low < high) { int pivotIndex = partition(arr, low, high); quickSort(arr, low, pivotIndex-1); quickSort(arr, pivotIndex+1, high); }}int main() { vector arr = {3, 6, 8, 10, 1, 2, 1}; quickSort(arr, 0, arr.size() - 1); copy(arr.begin(), arr.end(), ostream_iterator(cout, ",")); cout << endl; return 0;}

package mainimport "fmt"func partition(nums []int, low, high int) int {pivot := nums[high]i := low-1for j := low; j < high; j++ {if nums[j] <= pivot {i++nums[i], nums[j] = nums[j], nums[i]}}nums[i+1], nums[high] = nums[high], nums[i+1]return i+1}func quickSort(nums []int, low, high int) {if low < high {pivotIndex := partition(nums, low, high)quickSort(nums, low, pivotIndex-1)quickSort(nums, pivotIndex+1, high)}}func main() {nums := []int{3, 6, 8, 10, 1, 2, 1}quickSort(nums, 0, len(nums) - 1)for _, v := range nums {fmt.Printf("%d\t", v)}fmt.Println()}