**Java** ```java class Solution { static void swap(int[] array, int f, int n) { int t = array[f]; array[f] = array[n]; array[n] = t; } // 接受一个数组并递归地对其进行快速排序 public static void quickSort(int[] array, int p, int r) { if (p < r) { int q = partition(array, p, r); quickSort(array, p, q - 1); quickSort(array, q + 1, r); } } private static int partition(int[] array, int p, int r) { int pivot = array[r]; int i = p - 1; for (int j = p; j < r; j++) { if (array[j] <= pivot) { i++; swap(array, i, j); } } swap(array, i + 1, r); return i + 1; } } ``` **Python** ```python def quickSort(array, p, r): if p < r: q = partition(array, p, r) quickSort(array, p, q - 1) quickSort(array, q + 1, r) def partition(array, p, r): pivot = array[r] i = p - 1 for j in range(p, r): if array[j] <= pivot: i += 1 array[i], array[j] = array[j], array[i] array[i + 1], array[r] = array[r], array[i + 1] return i + 1 ``` **C++** ```c++ #include using namespace std; void swap(vector& array, int f, int n) { int t = array[f]; array[f] = array[n]; array[n] = t; } // 接受一个数组并递归地对其进行快速排序 void quickSort(vector& array, int p, int r) { if (p < r) { int q = partition(array, p, r); quickSort(array, p, q - 1); quickSort(array, q + 1, r); } } int partition(vector& array, int p, int r) { int pivot = array[r]; int i = p - 1; for (int j = p; j < r; j++) { if (array[j] <= pivot) { i++; swap(array, i, j); } } swap(array, i + 1, r); return i + 1; } ``` **JS** ```javascript var quickSort = function(array, p, r) { if (p < r) { var q = partition(array, p, r); quickSort(array, p, q - 1); quickSort(array, q + 1, r); } }; var partition = function(array, p, r) { var pivot = array[r]; var i = p - 1; for (var j = p; j < r; j++) { if (array[j] <= pivot) { i++; var temp = array[i]; array[i] = array[j]; array[j] = temp; } } var temp = array[i + 1]; array[i + 1] = array[r]; array[r] = temp; return i + 1; }; ```

快速排序概述

快速排序概述