Is there a way to sort a list with actors after the distance to another Actor and return the one with the shortest distance and all that efficiently enough to work without much lag in the act method cycles`?
erdelf wrote ...
2014/4/3
Distance list sorting
Then you should be able to do it in O(n) time. No different than finding the min/max of a list.
You need to login to post a reply.