@Amir I think convex hull will take O(nlogn) time Can u tell a O(n) algo
On Sun, Jun 27, 2010 at 9:43 PM, Amir hossein Shahriari < amir.hossein.shahri...@gmail.com> wrote: > it's obvious that these 2 points must be on the convex hull >> so first find the convex hull O(n) >> > > > -- Regards Jitendra Kushwaha MNNIT, Allahabad -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
