check the above solution.. urs is O(logn) mine is O(log k). On Jul 19, 11:35 pm, sagar pareek <sagarpar...@gmail.com> wrote: > well i dont think so...any better solution will be there compare mine one > > > > > > > > > > On Wed, Jul 20, 2011 at 12:00 AM, Dumanshu <duman...@gmail.com> wrote: > > heres the code > >http://ideone.com/rX130 > > > On Jul 19, 9:35 pm, swetha rahul <swetharahu...@gmail.com> wrote: > > > Hi, > > > Find the kth smallest element in O(logk) given 2 sorted arrays. > > > Merging the arrays is not allowed. I can do it in O(k).. How to do in > > > O(logk)..???? > > > -- > > 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. > > -- > **Regards > SAGAR PAREEK > COMPUTER SCIENCE AND ENGINEERING > NIT ALLAHABAD
-- 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.
