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
at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

Machine Learning certification course

A certification course in ML by Code Basics  

  • IT Full Forms
    Acronym Full Form AJAX Asynchronous JavaScript and XML API Application Programming Interface APK Android Application Package ASP Activ...
  • C program : To check whether M is an exact multiple of N
    #include<stdio.h> int main() {      int M,N,q;   scanf("%i %i",&M, &N);   if((M%N)!=0)   {printf("0...
  • Interview Tips
    "A good company understands that problem solving ability and the ability to learn new things are far more important than knowledge o...