7 votes 7 votes You are given two sorted lists of integers of size $m$ and $n$. Describe a divide and conquer algorithm for computing the $k$-th smallest element in the union of the two lists in time $O(\log m + \log n)$. Algorithms cmi2013 algorithms sorting divide-and-conquer descriptive + – go_editor asked May 23, 2016 go_editor 911 views answer comment Share Follow See 1 comment See all 1 1 comment reply reboot commented Jan 13, 2021 reply Follow Share https://stackoverflow.com/questions/4607945/how-to-find-the-kth-smallest-element-in-the-union-of-two-sorted-arrays 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Answer: soujanyareddy13 answered May 8, 2021 soujanyareddy13 comment Share Follow See all 0 reply Please log in or register to add a comment.