public static void quickSorting(int array[], int left, int right) {
		if (left < right) {
			int i = left, j = right, x = array[left];
			while (i < j) {
				while (i < j && array[j] >= x) { j--; }
				if (i < j) { array[i++] = array[j]; }
				while (i < j && array[i] < x) { i++; }
				if (i < j) { array[j--] = array[i]; }
				printArray(array, true);
			}
			array[i] = x;
			quickSorting(array, left, i - 1);
			quickSorting(array, i + 1, right);
		}
	}