Show that the worst case of adding an element is no longer O(1).
Suppose that the ArrayStack resized (grew) by creating a new array of size ℓ each time. The value of ℓ is arbitrary but finite (and fixed). Show that the worst case of adding an element is no longer O(1). In particular, show that the cost of resizing no longer has an amortized constant cost
joyce
0