Let us assume that the point are given in the form of (x1,x2,....xn). where n >1 and n is a natural number. Let the given point P is (xp1, xp2,...., xpn). Then we have the following algorithm.
For each of the point K = (a1,a2,...an) do the following 1. Set d := sqrt [(a1-xp1)^2 + (a2-xp2)^2 + ... + (an-xpn)^2]. 2. If d = D then output K. Running time order of number of number of points. -- 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.
