MergeBintoA.java

//http://coolcodebro.blogspot.com/2012/12/merge-b-into-a.html

void mergeBintoA(int[] arrayA, int[] arrayB, int lastIndexA) {
	int indexA = lastIndexA;
	int indexB = arrayB.length-1;
	int indexC = arrayA.length-1;
	
	//Merge
	while(indexA >= 0 && indexB >= 0)
		arrayA[indexC--] = arrayA[indexA] > arrayB[indexB] ? arrayA[indexA--] : arrayB[indexB--];
	
	//Fix the end if necessary
	while(indexB >= 0)
		arrayA[indexC--] = arrayB[indexB--];
}