【快速排序先左后右倒序排序】

public class QuickSort {
	public static void quickSort(int[] arr, int low, int high) {
		int i, j, temo, t;
		if (low >= high) {
			return;
		}
		i = low;
		j = high;

		temp = arr[high];
		while (i < j) {
			while (temp <= arr[i] && i < j) {
				i++;
			}
			while (temp >= arr[j] && i < j) {
				j--;
			}
		
			t = arr[j];
			arr[j] = arr[i];
			arr[i] = t;
		}
		arr[high] = arr[i];
		arr[i] = temp;
	
		quickSort(arr, low, j - 1);
		quickSort(arr, j + 1, high);
	}

	public static void main(String[] args) {
		int[] arr = {6, 1, 2, 7, 9, 3, 4, 5, 10, 8};
		quickSort(arr, 0, arr.length - 1);
		
		for (int i = 0; i < arr.length; i++) {
			System.out.println(arr[i]);
		}
	}
}

参考：快速排序（java实现）