Hello there

I have a 2D array with dimensions 2500*2500

And i have n < 10000

Now i am given an initial point in the array in the form of x,y and i need to find n points in the array that all points are as far from each other as possible

Bottom line is : i have an array and i need to find n positions in it as scattered as possible

This is not a problem i found on an online judge it's for a project i'm doing and im wondering if theres a way to accomplish this in reasonable complexity