Two sorted sequences of size m and n are given. Write an efficient
algo to find k-th smallest element in the set of combined m+n
elements. Note that the best possible algorithm runs in O(log(max
(m,n))).
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
