1. 题目
2. 思路
(1) 快速排序
3. 代码
public class Test {
public static void main(String[] args) {
}
}
class Solution {
public int[] MySort(int[] arr) {
sort(arr, 0, arr.length - 1);
return arr;
}
private void sort(int[] arr, int left, int right) {
if (left < right) {
int low = left;
int high = right;
int pivot = arr[low];
while (low < high) {
while (low < high && arr[high] >= pivot) {
high--;
}
arr[low] = arr[high];
while (low < high && arr[low] <= pivot) {
low++;
}
arr[high] = arr[low];
}
arr[low] = pivot;
sort(arr, left, low - 1);
sort(arr, low + 1, right);
}
}
}