Posted on July 05, 2005 at 4:00 AM
This is a sorting algorithm usefull for but not limited to pathfinding.
What it can do is return the smallest value in a list. The rest of the list is not sorted.
It should be very fast but I don't think it's faster than the data structures.
You can read something about it here (also where I learned/saw how to make it): <a style="text-decoration:underline overline;background:#ff0080;" href="http://www.policyalmanac.org/games/binaryHeaps.htm">Link</a>
Ok I compared this to a ds_priority...
It was 16,76 percent as fast so I don't really recommend using this for anything. I still think it's kinda interesting though...
Optimized the code. It now uses binary operators instead of multiplying by to and dividing and flooring 2.
Added fancy stuff.
Made the scripts easier to use.
Comments are currently disabled on games.