Two Step Process: 1) Finding the distance to every point for the requestion point 2) Finding the min among those. (n+n) --> O(n). I think it cannot be this simple.. more inputs please...
-- 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.
