public static void merge(int A[], int m, int B[], int n) {
		int indexA = m - 1;
		int indexB = n - 1;
		int indexMerge = m + n - 1;

		while (indexA >= 0 && indexB >= 0) {
			if (A[indexA] >= B[indexB]) {
				A[indexMerge] = A[indexA];
				indexA--;
				indexMerge--;
			} else {
				A[indexMerge] = B[indexB];
				indexB--;
				indexMerge--;
			}
		}
		if (indexA < 0) {
			for (int i = 0; i <= indexB; i++) {
				A[i] = B[i];
			}
		}
	}