⏭️ A simple implementation of a Priority Queue using heap in Python
A class PriorityQueue is implemented, as well as its methods:
- push()
- pop()
- isEmpty()
- update()
A function PQSort(list) sorts a list of integers, using the Priority Queue.
Tests are implemented from Giannis Zapantis.
They are checking all of the PriorityQueue functions and are listed in the corresponding file.