Xinok Sort Update

[Peter Alexander]

On 30/10/11 10:36 AM, Timon Gehr wrote:
> 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.

+1, you shouldn't ever need a sorting algorithm in an A* implementation.