public void quickSort(int[] array, int left, int right){
		int p = (left + right)/2;
		int pivot = array[p];
		int i = left;
		int j = right;
		while(i < j){
			while(i < p && pivot >= array[i]){
				++i;
			}
			if(i < p){
				array[p] = array[i];
				p = i;
			}
			while(j > p && pivot <= array[j]){
				--j;
			}
			if(j > p){
				array[p] = array[j];
				p = j;
			}
		}
		array[p] = pivot;
		if(p - left > 1){
			quickSort(array, left, p - 1);
		}
		if(right - p > 1){
			quickSort(array, p + 1, right);
		}
	}