MockP1: Check the priority of each item in the queue, starting at the back and moving it along one place until an item with the same or lower priority is found, at which point the new item can be inserted

Question

Check the priority of each item in the queue, starting at the back and moving it along one place until an item with the same or lower priority is found, at which point the new item can be inserted

Sozen · Accepted Answer

How would you implement a priority queue?

MockP1

Check the priority of each item in the queue, starting at the back and moving it along one place until an item with the same or lower priority is found, at which point the new item can be inserted

How would you implement a priority queue?

Author