AND, for two points to be close, they need not be on the same quadrant On Dec 21, 10:55 pm, atul anand <[email protected]> wrote: > to find all points which lies on the same quadrant for a specific node(say > 1) , we have to check all nodes...rite?? > we have to find difference b/w 2 node(frome origin ) is less or greater > than distance b/w 2 nodes...rite?? > > so if i am not getting it wrong it wil be O(n^2) anyhow. > > > > > > > > On Thu, Dec 22, 2011 at 8:14 AM, rahul <[email protected]> wrote: > > @harish What if all the points are in the same quadrant and and are > > equidistant from 0,0. > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To view this discussion on the web visit > >https://groups.google.com/d/msg/algogeeks/-/NjysUthIqgYJ. > > 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.
-- 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.
