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

	}