public static void quickSort(int[] input, int low, int high) {
		int i = low, j = high;
		int pivot = input[low+(high-low)/2];
		while(i <= j) {
			while(input[i] < pivot){
				i++;
			}
			while(input[j] > pivot){
				j--;
			}
			if(i <= j) {
				int tmp = input[i];
				input[i] = input[j];
				input[j] = tmp;
				i++;
				j--;
			}
		}
		if(low < j)
			quickSort(input,low,j);
		if(i < high)
			quickSort(input,i,high);
	}