June 2020
Intermediate to advanced
382 pages
11h 39m
English
Content preview from 40 Algorithms Every Programmer Should Know
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
The time complexity of stacks
Let's look into the time complexity of stacks (using Big O notation):
| Operations | Time Complexity |
| push | O(1) |
| pop | O(1) |
| size | O(1) |
| peek | O(1) |
An important thing to note is that the performance of none of the four operations mentioned in the preceding table depends on the size of the stack.