Editing Priority queue (section)

=== Naive implementations ===

One can create a simple, but inefficient priority queue in a number of ways. These naive implementations can demonstrate the expected behaviour of a priority queue in a simpler manner.

* ''insert'' elements into an unsorted array; find and ''extract'' element with ''highest priority''
*: Performance: "''insert''" performs in O(1) constant time, where "''extract_max''" performs in O(n) linear time.

 '''insert'''(element, priority):
     node.element ← element
     node.priority ← priority
     list.append(node)
 
 '''extract_max'''():
     highest ← 0
     foreach node in list:
         if highest.priority < node.priority:
             highest ← node
     list.remove(highest)
     return highest.element

* ''insert'' elements into a sorted array; ''extract'' first element
*: Performance: "''insert''" performs in O(n) linear time, where "''extract_max''" performs in O(1) constant time.

 '''insert'''(element, priority):
     node.element ← element
     node.priority ← priority
     for i in [0...N]:
         element ← list.get_at_index(i)
         if element.priority < node.priority:
             list.insert_at_index(node, i + 1)
             return
 
 '''extract_max'''():
     highest ← list.get_at_index(0)
     list.remove(highest)
     return highest.element