Answer to Question lec33C-3
No. Imagine a long sequence of insertions. If only one slot
is added to the array each time, then each insertion takes
Θ(n) time to do, where n is the number of values in the
queue at the time. If the array starts with 10 slots, then the
time needed to insert
100 values would be a constant times 10 + 11 + 12 + 13 + … + 100.
Inserting n values would take time Θ(n2).
(Remember that 1 + 2 + … + n = n(n+1)/2.)