@Ganesha: You could use a max-heap of size k in time O(n log k), which is less than O(n log n) if k < O(n).
Dave On Nov 22, 8:56 am, ganesha <[email protected]> wrote: > Given a set of points in 2D space, how to find the k closest points > for a given point, in time better than nlgn. -- 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.
