public void quickSort(int low, int high, int[] result) {

		int i = low, j = high;
		int pivot = result[i + (j - i) / 2];
		do {
			while (result[i] < pivot)
				i++;
			while (result[j] > pivot)
				j--;

			if (i <= j) {
				exchange(i, j, result);
				i++;
				j--;
			}

		} while (i <= j);
		if (low < j)
			quickSort(low, j, result);
		if (i < high)
			quickSort(i, high, result);
	}