- Algorithms
- Recursion
- Call Stack ♣
- Iterative Approach
- Memoization
- Head Tail
- Data Structures
- Arrays, Sets
- Time Complexity
- Hash Tables
- Stacks
- Queues
- Linked Lists
- Binary Search Trees
- Tries
- Graphs
- Divide Conquer
- Binary Search
- Quicksort
- Merge Sort
- Karatsuba Multiplication
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search
- Dijkstra's Algorithm
- Decision Making
- Minimax
Algorithms
Machine Learning
Recursion / Call Stack »
The call stack manage the order of function calls. A frame object represents the state of a function call. In Python, the limit of stack size is around 1000. To avoid a crash there must be a base case.
What is the call stack? What is a frame object? What is the stack overflow limit in Python? How do we avoid a crash when using recursion?
Click to Flip Card
