Why is a circular array implementation not as attractive as an implementation of a list as it was for a queue?

The circular array implementation of queue is more attractive than that of the queue because in queue the circular array implementation improved the efficiency of the deque operation before it was O (n) after circular array implementation it is O (1) because there is no need to shift the array.

While in a list we can add or delete elements from anywhere in the list.