[Utility] Binary Heap (sort)

[AalaarDB]

A binary heap is a type of lazy sort, with best on top and the rest in a 'heap'. The key is an integer, with lowest on top. To use it, initialize a maxSize+1 array, and set first element to 0. Insert all data like normal, but to get it back into sorted order, remove element 1 (like pop top element but I didn't wrap it) continuously until element 0 reads 0.

This file is only intended for other scripters who want to sort data. Binary Heap Sort