title: Given 2 sorted arrays of integers, find the nth largest number in sublinear time
body: <blockquote>
    <p><strong>Possible Duplicate:</strong><br>
    <a href="https://stackoverflow.com/questions/4607945/how-to-find-the-kth-smallest-element-in-the-union-of-two-sorted-arrays">How to find the kth smallest element in the union of two sorted arrays?</a>  </p>
  </blockquote>
  
  
  
  <p>This is a question one of my friends told me he was asked while interviewing, I've been thinking about a solution.</p>
  
  <p>Sublinear time implies logarithmic to me, so perhaps some kind of divide and conquer method. For simplicity, let's say both arrays are the same size and that all elements are unique</p>