Data Structures And Algorithms
Tuesday, February 21, 2012
kth smallest element in the union of the two sorted arrays
Problem:
Given two sorted arrays A and B of length n, find the kth smallest element in the union of the two sorted arrays. Do so in Θ(lgn).
Complexity:
O(log N)
Code:
‹
›
Home
View web version