You don't have access to this post on Coding Today at the moment, but if you upgrade your account you'll be able to see the whole thing, as well as all the other posts in the archive! Subscribing only takes a few seconds and will give you immediate access.
Find the k Points having the shortest distance from point A.
Given a point A (x,y) on a 2D plane and n number of Coordinates, find the k points having the shortest distance from point A.