Compares vector- and linked-list-based stack implementations, focusing on push and pop efficiency and where to place the stack’s top in the list.
Save to open this file
Stanford CS106B: Programming Abstractions
All
- 01-About the CS106 Series at Stanford
01-About the CS106 Series at Stanford
- 02-Similarity between C++ and Java
- 03-C++ Libraries
- 04-C++ Console I/O
- 05-Client Use of Templates
- 06-More Containers
- 07-Seeing Functions as Data
- 08-Solving Problems Recursively
- 09-Thinking Recursively
- 10-Recursion and Backtracking
- 11-Backtracking Pseudocode
- 12-Pointer Movie
- 13-Coding with Linked List
- 14-Algorithm Analysis
- 15-Selection Sort
- 16-Partitioning for Quicksort
- 17-Sort Template with Callback
- 18-Abstract Data Types
- 19-Rules of Template Implementation
- 20-Stack and Queue Implementations
- 21-Buffer: Vector vs Stack
- 22-Map as Vector
- 23-Pathfinder Demo
- 24-Compare Map Implementations
- 25-Lexicon Case Study
- 26-Final Showdown
- 27-Guest Lecturer: Keith Schwarz