Question: Suppose we have two ordered lists S and T , each one with n elements. a) Give an algorithm that finds the n-th element of

Suppose we have two ordered lists S and T, each one with n elements.

a) Give an algorithm that finds the n-th element of SUT in O(log2n) (don't calculate SUT, this takes O(n)).

b) Give a lower bound complexity for this problem or find a more efficient algorithm.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!