It was my lab assignment prob last year. Will send u if i happen to find it by chance. -------------------------------------------------- Rohit Saraf Second Year Undergraduate, Dept. of Computer Science and Engineering IIT Bombay http://www.cse.iitb.ac.in/~rohitfeb14
On Mon, Jun 14, 2010 at 10:31 PM, Jitendra Kushwaha < [email protected]> wrote: > Given n points in the space. Now given a new point you have to find > the nearest neigbour to it from initial n points > This can be done in O(n), a trivial solution. > This can also be accomplished in O(logn) by space partioning. here is > a link: > > http://en.wikipedia.org/wiki/Nearest_neighbor_search#Space_partitioning > > can anybody give a pseudo code or commented C code to impliment it. I > do not understood how to implement it. > > this is a google interview question and its variation is a amazon's > question. :) > > -- > 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]<algogeeks%[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.
