|
If the problem is 'finding items near a specified player', I believe it is O(n) where n is number of items.
If the problem is 'finding items near each player' I believe it is O(p*n), where p is number of players and n is number of items.
In that sense, it might be roughly O(n*n) where n is number of players.
Finding players near each player would be O(n*n), where n is number of players.
|