Merge Sorted Array

   /**
	 * Given two sorted integer arrays A and B, merge B into A as one
sorted
	 * array.
	 * 
	 * Note: You may assume that A has enough space to hold additional
elements
	 * from B. The number of elements initialized in A and B are m and n
	 * respectively.
	 * 
	 * Thoughts for This Problem
	 * 
	 * The key to solve this problem is moving element of A and B
backwards. If
	 * B has some elements left after A is done, also need to handle that
case.
	 * 
	 * The take away message from this problem is that the loop condition.
This
	 * kind of condition is also used for merging two sorted linked list.
	 * 
	 * */