On 10/30/2011 09:52 AM, Max Wolter wrote:
Hey there.Thanks for your good work. I decided to test your xinok sort in my implementation of the A* algorithm; since the list of open nodes will always be partially sorted, it should give better performance than the phobos sort. /Max
You might want to consider using a heap to maintain the list of open nodes instead.
