public void merge(int A[], int m, int B[], int n) {
		int a = n;
		int b = 0;
		int c = 0;

		for (int i = m; i > 0; i--) {
			A[i + n - 1] = A[i - 1];
		}

		while (a < m + n && b < n) {
			if (A[a] < B[b]) {
				A[c] = A[a];
				a++;
			} else {
				A[c] = B[b];
				b++;
			}
			c++;
		}

		while (c < m + n) {
			if (b < n) {
				A[c] = B[b];
				b++;
			} else {
				A[c] = A[a];
				a++;
			}
			c++;
		}

	}