Create priorityQ_Sort.py

Blooverh · Blooverh · commit 09bfe6536ec9 · 2023-07-13T20:40:14.000-05:00
diff --git a/PriorityQueueChpt/priorityQ_Sort.py b/PriorityQueueChpt/priorityQ_Sort.py
@@ -0,0 +1,15 @@
+from collections import heapq
+from LinkedLists import PositionalList 
+import PriorityQueue 
+def pq_sort(C):
+    """Sort a collection of elements stored in a Positional List"""
+    n= len(C)
+    P= PriorityQueue() 
+
+    for i in range(n):
+        element= C.delete(C.first())
+        P.add(element, element) #use element as key and value 
+
+    for j in range(n):
+        (k,v)= P.remove_min()
+        C.add_last(v) #store smallest remaining element in C 
