public void quickSort(int[] array, int begin, int end){
		int left = begin;
		int right = end;
		int t = array[left];
//		int temp[] = new int[array.length];
		while(left < right){
			while(left < right && t <= array[right])
				right--;
			if(left < right)
				array[left] = array[right];
			while(left < right && t > array[left])
				left++;
			if(left < right)
				array[right] = array[left];
		}
		array[left] = t;
		if(left - begin > 1)
			quickSort(array,begin,left-1);
		if(end - left > 1)
			quickSort(array,left+1,end);
	}