Priority Queue Test Algorithm

In computer science, a double-ended priority queue (DEPQ) or double-ended heap is a data structure like to a priority queue or heap, but lets for efficient removal of both the maximal and minimum, according to some ordering on the keys (items) stored in the structure. In a DEPQ, it is possible to remove the components in both ascending as well as descending order.

Priority Queue Test source code, pseudocode and analysis