/**
 * @author zoujc
 * @date 2018/11/15
 * 快速排序:時間複雜度：O(NlogN)
 */
public class ArrayQuickSort {
	public static void quickSort(int arr[], int low, int high){
		//1.找到遞迴演算法的入口
		if(low > high){
			return;
		}
		//2.存
		int i = low;
		int j = high;
		//3.key
		int key = arr[low];
		//4.完成一趟排序
		while (i <
 
 j){
			//4.1從右往左找，找到第一個比key小的數
			while (i < j && arr[j] > key){
				j --;
			}
			//4.2從左往右找，找到第一個比key大的數
			while(i < j && arr[i] <= key){
				i ++;
			}
			//4.3交換
			if(i < j){
				int temp = arr[i];
				arr[i] = arr[j];
				arr[j] = temp;
			}
		}
		//4.4調整key的位置
		int temp =
 
 arr[i];
		arr[i] = arr[low];
		arr[low] = temp;
		//5.對key左邊的數快排
		quickSort(arr,low,i-1);
		//6.對key右邊的數快排
		quickSort(arr,i+1,high);
	}

	public static void main(String[] args){
	 	int arr[] = {56,98,55,74,14,1,2,32,0,66,88,99,44};
	 	quickSort(arr,0,arr.length-1);
	 	for(int i=0; i<arr.length; i++){
 

	 		System.out.print(arr[i] + " ");
		}
	}
}