Implementing Stacks & Queues

What insertion strategy is implemented in this Priority Queue?

class PriorityQueue {
  constructor() {
    this.items = [];
  }
  
  enqueue(element, priority) {
    const qElement = { element, priority };
    let added = false;
    
    for (let i = 0; i < this.items.length; i++) {
      if (this.items[i].priority > priority) {
        this.items.splice(i, 0, qElement);
        added = true;
        break;
      }
    }
    
    if (!added) this.items.push(qElement);
  }
}

Random insertion
FIFO ordering
Sorted insertion by priority
This implements sorted priority insertion by: 1) Maintains elements in priority order, 2) Inserts new elements at correct position based on priority, 3) Uses linear search to find insertion point, 4) Ensures higher priority elements are dequeued first, 5) Implements basic priority queue behavior, 6) Could be optimized with heap structure, 7) Suitable for small to medium queues, 8) Common pattern in task scheduling systems.
Stack-based insertion

Next Question (8/20)