Binary Heap

by Crazy Star

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="">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 buttons.
Added fancy stuff.
Made the scripts easier to use.

Old file:

Requiem commented July 08, 2005 at 11:01 PM
Er... whaaat?
Crazy Star commented July 09, 2005 at 12:07 AM
Well... yeah.
If you don't know what a binary heap is then this will probably be of no use to you.

noshenim commented June 03, 2006 at 10:20 PM
er, right
a little wierd
DevonX commented November 01, 2006 at 11:56 PM
hmmm......alright. 9/10. Nice (even tho i have no idea wut im taling about)
Crazy Star commented March 17, 2007 at 10:58 PM
Second version out =)