Question: Consider an implementation of the vector ADT using an extendable array, but instead of copying the elements into an array of double the size (that
Consider an implementation of the vector ADT using an extendable array, but instead of copying the elements into an array of double the size (that is, from N to 2N) when its capacity is reached, we copy the elements into an array with ?N/4? additional cells, going from capacity N to N+?N/4?.Show that performing a sequence of n push operations (that is, insertions at the end) still runs in O(n) time in this case.
Step by Step Solution
3.45 Rating (165 Votes )
There are 3 Steps involved in it
To demonstrate that a sequence of n push operations still runs in On time when using an extendable array that grows by leftlceil fracN4 ight ceil addi... View full answer
Get step-by-step solutions from verified subject matter experts
