Lecture 12

Learning Outcomes

At the end of this lecture, you’ll be able to:

• Explain and trace the core operations of Stack (push, pop, top, empty).
• Describe the difference between top and pop.
• Implement the core operations of Stack efficiently (array based and linked base).
• Implement an array based stack that dynamically grows as more space is needed.
• Determine the cost of dynamically resizing an array-based implementation of stack.
• Describe what amortized analysis is.
• Explain the difference between amortized constant time and actual constant time.
• Elaborate on the importance of array growth factor to maintain amortized constant time push operation.