SortedMerge
problem
You are given two sorted arrays, A and B, where A has a large enough buffer at the end to hold B. Write a method B into A in sorted order.
how to solve
In this problem, I can use array A which has a large enough buffer at the end to hold B. So I insert elements into the back of the array in greedy.