CareerCup

That would not work,, what if the element is some where between max and min, you cannot just enter it anywhere right?

Max- heap, is said of using priority heap, but complexity for it is nlogn which is very high compared to 0(1), so that too would not work.

I said it wrong, if the new distance is smaller than the max of the 10-element array, which is at one end of the array since the array is kept sorted, simply throw away the max and insert the new distance in, much like in insertion sort. And since the array has up to 10 element, the insertion takes O(10) each time a new distance is inserted or O(1) if larger than the max. As to heap, we also only keep up to 10 elements in the max heap

convert the array to a heap, then the complexity is o (log(10))

o (log(10)) is O(1) :)

By centre it means, point<0,0> and all the other points are anywhere in 4 quadrants

do we need to keep all points added or just to return the 10 nearest?

I have an array of points, will add from thr.....

But as i add points, i should be able to get the min distance point any time with 0(1).