juniorDivide & Conquer
What is a recurrence relation?
Updated Apr 28, 2026
Short answer
A mathematical formula that describes the running time of a recursive algorithm.
Deep explanation
Divide and Conquer is essential for efficient algorithms. A mathematical formula that describes the running time of a recursive algorithm. It transforms a large, complex problem into manageable chunks, reducing the overall computational effort compared to brute-force approaches.
Real-world example
Searching for a word in a physical dictionary.
Common mistakes
- Forgetting the base case, leading to infinite recursion/StackOverflow.
Follow-up questions
- Is Binary Search better than Linear Search?