Trying to figure out which one is more optimal to use and implement.
One efficient way to implement a priority queue is heapsort O(n logn).
E
