@Ashish: could u plz explain ur algo in detail. "walk over the merged list to get adjacent min distance and different tags" this would be of the order O(m*n) say we merge A1 A2 of size m and n respectively. Also, now how do u go ahead with the 3rd array? didn't get ur solution.
Harshal's solution looks fine. ny bugs? On Jun 17, 9:13 pm, Ashish Goel <ashg...@gmail.com> wrote: > merge two and if required third array keeping array tag with the elements > walk over the merged list and see adjacent distance which is minimum with > the condition that the tage of the adjacent elements are different > > Best Regards > Ashish Goel > "Think positive and find fuel in failure" > +919985813081 > +919966006652 > > > > On Fri, Jun 17, 2011 at 9:36 PM, Dumanshu <duman...@gmail.com> wrote: > > U have got 3 sorted arrays A1 A2 and A3 having m n and p elements > > respectively. A gap of 3 arrays is defined to be max distance between > > 3 nos if they are put on a no line say u pick three 2 12 and 7 then > > the gap is 10. Now u have to find an efficient way of chosing 3 nos > > from these 3 seperate arrays (A1, A2, A3) such that their gap is > > minimum. Of course if a num say 2 occurs in all 3 then gap is 0!!! > > > -- > > 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.- Hide quoted text - > > - Show quoted text - -- 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.
