News for hackers. Stuff that matters.
Re:Pearl No. 4 – Kth Smallest in the Union of Two Sorted Col... by pronoiac on Thursday October 19, 2017 @04:57PM (#15511493)
If you're like me, and have forgotten union vs intersection, I'll restate the question: Sets A and B are each sorted, and they have no elements in common. If you combine A and B, what would be the kth smallest element?
Re:Pearl No. 4 – Kth Smallest in the Union of Two Sorted Col... by OJFord on Friday October 20, 2017 @03:49AM (#15514171)
The sets do not necessarily have no elements in common - their union is the set of all the elements in either of them. (Being a set, it does not have 'duplicates' even if an element appears in both of your A and B.)
Re:Pearl No. 4 – Kth Smallest in the Union of Two Sorted Col... by pronoiac on Friday October 20, 2017 @05:10PM (#15519133)
The lack of overlap is mentioned in the body, but not in the title.

The title is so close to presenting the problem on a way that people could fully consider how they'd handle the problem before following the link. Just add "disjoint" to the title.