Priority Queues are very useful and usually, are implemented using heaps. This Priority Queue is implemented using an array that sorts itself rather than an overly complicated binary tree or heap. A priority queue is very useful for event-oriented programming, multitasking processes, and online message queues.
These are posts from previous incarnations of my blog. They catalog old writing, (abandoned) projects, and else-wise content I have written in the past that others have found engaging or useful. You'll notice the sidebars reflect the content of the archival posts rather than my current blog; for current posts click on the logo above.