public void merge(int left, int mid, int right) {
		for (int i = left; i <= right; i++)
			helper[i] = numbers[i];
		int i = left, j = mid + 1, k = left;
		while (i <= mid && j <= right) {
			if (helper[i] < helper[j]) {
				numbers[k++] = helper[i++];
			} else {
				numbers[k++] = helper[j++];
			}
		}
		while (i <= mid) {
			numbers[k++] = helper[i++];
		}
		while (j <= right) {
			numbers[k++] = helper[j++];
		}
	}