K closest points to a query location
Given a list of 2D points and a query location, return the k points closest to it by Euclidean distance.
Compare sorting, a size-k max-heap and quickselect, and say which you would use when the points arrive as a stream.
UberCodingNo answer yet. Write the first one; the best answer gets endorsed.