快排

package TestCode;

public class QuickSort {
	public void quickSort(int[] arr, int low, int high) {
		if (low < high) {
			int index = getIndex(arr, low, high);

			quickSort(arr, low, index);
			quickSort(arr, index + 1, high);
		}
	}

	public int getIndex(int[] arr, int low, int high) {
		int tmp = arr[low];// 基准数据

		while (low < high) {
			// 当队尾的元素大于等于基准数据时,向前挪动high指针
			while (low < high && arr[high] >= tmp) {
				high--;
			}
			// 如果队尾元素小于tmp了,需要将其赋值给low
			arr[low] = arr[high];
			// 当队首元素小于等于tmp时,向前挪动low指针
			while (low < high && arr[low] <= tmp) {
				low++;
			}
			// 当队首元素大于tmp时,需要将其赋值给high
			arr[high] = arr[low];
		}
		arr[low] = tmp;
		
		return low;
	}
	public static void main(String[] args) {
		int[] arr={5,9,10,2,5,1,6,18,26,45,22};
		QuickSort quick=new QuickSort();
		quick.quickSort(arr, 0, arr.length-1);
		for(int num:arr){
			System.out.print(num+" ");
		}
	}
}