Circular Queue

Question

Answer 1

S1: In the worst case , middle element of array will be deleted,then we have to adjust the position of (n/2) elements, which will take O(n) time,

S2: Just Interchange, two variables First & Last in O(1) Then print from first to last , elements will be printed in reverse order.

Option (b)

Comments

@The_Toad_Sage

Can you please elaborate this line further:

In the worst case , middle element of array will be deleted,then we have to adjust the position of (n/2) elements,

---

Is that mean swapping $\mathbf{\frac{n}{2}}$ elements?