Please help me out with following problem -
Given a set of restaurants (the number being quite large) and its geographical location(x,y) , you are allowed to do an significant amount of pre-processing on it. Now suppose there are x customers located at position (s,t), design an efficient algorithm to find the k nearest restaurants to these customers.
<<This question (but not the answer) may be found at http://www.geeksforgeeks.org/directi-interview-set-3/
It may also be available elsewhere on the internet, >> Edited by byundt 12 September 2014 so thread complies with site rules on proper attribution, as well as the Creative Commons rules followed by the geeksforgeeks.org web site.