public void qSort(int[] array, int begin, int end){
//		if(begin == end)return;
		int temp = array[begin];
		int left = begin;
		int right = end;
		while(left < right){
			while(left < right && temp <= array[right])
				right--;
			if(left < right)
				array[left] = array[right];
			while(left < right && array[left] < temp)
				left++;
			if(left < right)
				array[right] = array[left];
		}
		array[left] = temp;
		if(left - begin > 1)
			qSort(array, begin, left - 1);
		if(end - left > 1)
			qSort(array, left + 1, end);
	}