Find closest (m) points using cosine distance - Python

[prashanthrd]

I am given n data points in the form of list of tuples like S=[(x1,y1),(x2,y2) ,(x3,y3),(x4,y4 ),(x5,y5),..,(x n,yn)] and a point P=(p,q)
My task is to find 5 closest points in S from P. We have to use cosine distance.

Example:

S= [(1,2),(3,4),(-1,1),(6,-7),(0, 6),(-5,-8),(-1,-1)(6,0),(1,-1)]
P= (3,-4)
Output:
(6,-7)
(1,-1)
(6,0)
(-5,-8)
(-1,-1)

I need to write python program for this. I am not getting any idea where to start. Any clues on how to start writing this program.

[dwblas]

There is no Python being used in the above post. Please move to a math forum, or where ever is most appropriate.

[prashanthrd]

Hi,
I need to write a python program for the above. Since I dont know where to start on this, I have posted it.