Thursday, February 28, 2019

Solving Recurrence Relations: By guessing the answer

We can solve Recurrence Relations by guessing the answer correcctly. Which can be done by unfolding the recurrence and seeing that whether a pattern exists. This video by NPTEL explains it in a wonderful way:

https://nptel.ac.in/courses/111/106/111106086/

Guessing the answer by Unfolding the recurrence

Proof by Guessing followed by proving with Induction

Tower of Hanoi

No comments:

Post a Comment

Resources for preparing for SDE2/SDE3 roles

Software Design principals and patterns. (Design Patterns)  1.  https://bytebytego.com/ 2.  https://refactoring.guru/