In a array-based implementation of a queue that stores the front of the queue at index 0 in the array, the dequeue operation is ___________________. A) impossible to implement B) has several special cases C) O(n) D) O(n²) E) none of the above

Question

Quizplus · Accepted Answer

It requires a linear amount of time to shift all elements of the queue down an index after a remove is applied.

In a Array-Based Implementation of a Queue That Stores the Front