Introduction - If you have any usage issues, please Google them yourself
Let X [0: n-1] and Y [0: n-1] for the two arrays, each array containing the n number has been sorted. Try to design an O (log n) time algorithm to find the X and Y 2n median number.