Has anyone written a relatively efficient array-based priority queue?
(preferably with dynamic bounds)
I could probably cook something up myself, if I had to, but if anyone has one
that I could use, I'd be grateful.
That said, a P-Queue structure might make a nice addition to the SDL...
A.D.B.
