> As some of you may know I'm now taking an CS education. (At last).
> In an exercise in the course "Algorithm and complexity",
I was faced
> with this challenge:
> Describe an algorithm that takes two ordered sets (implemented as
> arrays) S and T (no duplicates in the two sets) of size n, and k,
> find the k-th smallest key in the union of S and T. The running time
> should be of order O(lg n).