Question

Q1) Using Divide and conquer approach, solve the kth element in 2 sorted arrays problem. Given two sorted arrays both of size n find the element in k’th position of the combined sorted array.
1. Mention the steps of Divide, Conquer and Combine (refer to L5- Divide and Conquer Lecture notes, slide 3, to see an example on merge sort)

2. Draw the recursive tree.

3. What is the recurrence equation?

4. Guess a solution based on the recursive tree and then use substitution method to prove the upper and lower bound.

Answer 1

if you have any problem plz ask