Question: 2. (20p) You are given two sorted sequences which consist of distinct elements. Design an algorithm that finds the kth smallest element in the union
2. (20p) You are given two sorted sequences which consist of distinct elements. Design an algorithm that finds the kth smallest element in the union of both sequences. The running time of your algorithm should be Olog n+log m) in the worst case where n and m are the sizes of the sequences
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
