Recurrence Relations
← Back to Discrete Mathematics
Equations that define sequences recursively, where each term is a function of preceding terms. Solving recurrences is essential for analyzing recursive algorithms and deriving closed-form time complexities.
Key Properties
Related
- Dynamic Programming (solving overlapping recurrences)
mathematics-for-cs discrete-mathematics recurrence-relations