Question: 2. (20p) You are given two sorted sequences which consist of distinct elements. Design an algorithm that finds the kth smallest elemegt in the union

2. (20p) You are given two sorted sequences which consist of distinct elements. Design an algorithm that finds the kth smallest elemegt in the union of hoth sequences. The running time of your algorithm should be 0(logn+logm) 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
