juniorRecursion
What is the time complexity of a simple recursive search?
Updated Apr 28, 2026
Short answer
Usually O(n) as each element is visited once.
Deep explanation
Recursion allows for elegant solutions to hierarchical problems. Usually O(n) as each element is visited once. However, it requires careful handling of the stack to prevent memory exhaustion.
Real-world example
Traversing a family tree.
Common mistakes
- Forgetting the base case, leading to infinite recursion.
Follow-up questions
- What is the space complexity?