A recurrence relation defines terms of a sequence using earlier terms.
What Is Recurrence Relation?
A recurrence relation defines terms of a sequence using earlier terms.
Examples of Recurrence Relation
1
Fₙ=Fₙ₋₁+Fₙ₋₂ defines the Fibonacci sequence.Formula and Key Points
Formula / rule
aₙ = F(aₙ₋₁, …)
- Know the definition and standard notation for Recurrence Relation.
- Be able to recognise or compute recurrence relation in a small example.
- Connect the concept to nearby topics in the same subject before using it in larger CSE problems.
Why This Matters in Computer Science
Used in algorithm proofs, counting, recurrence analysis, data structures and theoretical computer science. Used to express recursive algorithm costs such as T(n)=2T(n/2)+n.
Related Math Terms
Recurrence Relation: Frequently Asked Questions
What is Recurrence Relation?
A recurrence relation defines terms of a sequence using earlier terms.
Why is Recurrence Relation useful in computer science?
Used in algorithm proofs, counting, recurrence analysis, data structures and theoretical computer science. Used to express recursive algorithm costs such as T(n)=2T(n/2)+n.