Recurrence Relations

A recurrence relation defines a sequence based on previous terms. They’re widely used to analyze algorithms (like MergeSort), generate number sequences (like Fibonacci), or model dynamic systems.

Example: Fibonacci recurrence:

F(n) = F(n−1) + F(n−2)

Application: algorithm analysis, discrete modeling, combinatorics, dynamic programming.