i think it can be done in O( nlogk) using heap. i cant get how u can do it (n + klgn) time.
On Dec 6, 4:49 pm, alexsolo <[email protected]> wrote: > look here:http://en.wikipedia.org/wiki/Kd-tree -- 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.
