I need to find the kth smallest element in the union of 2 sorted
arrays in O(log |A| + log |B|) time. I understand this is similar
to binary search, but I don't understand which parts of the arrays
I can throw out at each level of recursion, and why. In the
pseudocode below, what should go into $1 through $16 and why?
// A and B are each sorted into ascending order, and 0 <= k
< |A|+|B|
//...