快速排序(QuickSort):最简洁版本双指针实现
class Slution {
private void quickSort(int[] array) {
quickSort(array, 0, array.length - 1);
}
private void quickSort(int[] array, int start, int end) {
if (start < end) {
int pivot = partition(array, start, end);
quickSort(array, start, pivot - 1);
quickSort(array, pivot + 1, end);
}
}
private int partition(int[] array, int start, int end) {
int pivot = array[start];
int left = start;
int right = end;
while (left < right) {
while (array[right] >= pivot && left < right) {
right--;
}
while (array[left] <= pivot && left < right) {
left++;
}
swap(array, left, right);
}
swap(array, start, left);
pivot = left;
return pivot;
}
private void swap(int[] array, int i, int j) {
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
public void print(int[] array) {
for (int j: array) {
System.out.print(j + " ");
}
}
public static void main(String[] args) {
Solution solution = new Soluiton();
int[] array = new int[]{2, 6, 2, 8, 7, 4, 5, 9, 2};
solution.quickSort(array);
solution.print(array);
}
}