check this code http://ideone.com/rX130 compares k/2 values of each array taking care of extremes.
On Jun 24, 9:48 pm, Decipher <ankurseth...@gmail.com> wrote: > Can anybody please explain how to solve this question with logarithmic > time complexity ? > > Write the code/algorithm to find the k-th Smallest Element in the > Union of Two Sorted Arrays . -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
