private static void doQuickSort(Integer[] inputArray, int low, int high) {
		
		if(inputArray == null || inputArray.length == 0){
			return;
		}		
		if(low >= high){
			return;
		}
		
		int middle = low + (high - low)/2;		
		System.out.println("Middle : " + middle); 
		int pivot = inputArray[middle];
		System.out.println("Pivot : " + pivot);
		
		int i = low, j = high;
		
		while(i<=j){
			while(inputArray[i] < pivot){
				i++;
			}
			while(inputArray[j] > pivot){
				j--;
			}
			if(i<=j){
				swap(inputArray, i, j);
				i++;
				j--;
			}
		}//while end
		System.out.println("low : " + low + ", high : " + high + ", i : " + i + ", j : " + j);
		if(low < j){
			doQuickSort(inputArray, low, j);
		}
		if(high > i){
			doQuickSort(inputArray, i, high);
		}
	}