Priority Queue Python implementation

Author: OmkarPathak

Queue/PriorityQueue.py

@@ -0,0 +1,40 @@
+# Author: OMKAR PATHAK
+
+class PriorityQueue(object):
+    def __init__(self):
+        self.queue = []
+
+    def __str__(self):
+        return ' '.join([str(i) for i in self.queue])
+
+    # for checking if the queue is empty
+    def isEmpty(self):
+        return len(self.queue) == []
+
+    # for inserting an element in the queue
+    def insert(self, data):
+        self.queue.append(data)
+
+    # for popping an element based on Priority
+    def delete(self):
+        try:
+            max = 0
+            for i in range(len(self.queue)):
+                if self.queue[i] > self.queue[max]:
+                    max = i
+            item = self.queue[max]
+            del self.queue[max]
+            return item
+        except IndexError:
+            print()
+            exit()
+
+if __name__ == '__main__':
+    myQueue = PriorityQueue()
+    myQueue.insert(12)
+    myQueue.insert(1)
+    myQueue.insert(14)
+    myQueue.insert(7)
+    print(myQueue)                # 12 1 14 7
+    while not myQueue.isEmpty():
+        print(myQueue.delete(), end = ' ')    # 14 12 7 1