i don't know exactly, mode can be the point P. On 4/25/12, tech coder <[email protected]> wrote: > Given N points(in 2D) with x and y coordinates. You have to find a > point P (in N given points) such that the sum of distances from > other(N-1) points to P is minimum. > > -- > > Regards > "The Coder" > > -- > 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?hl=en. > >
-- **Regards * * <[email protected]> Bharat B | M.Tech II | C.S.E | IITM * * *Ph: +91 8056127652* -- 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?hl=en.
