0 votes 0 votes Solve the following recurrence relation :- N(h)=N(h−1)+N(h−2)+1 Programming in C recurrence-relation time-complexity algorithms + – bts asked Jul 27, 2018 bts 504 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Shubham Shukla 6 commented Jul 27, 2018 reply Follow Share @rishav do you know tree method....if you know use that 0 votes 0 votes Shubham Shukla 6 commented Jul 27, 2018 i edited by Shubham Shukla 6 Jul 27, 2018 reply Follow Share check this image rishav 1 votes 1 votes nephron commented Oct 31, 2018 reply Follow Share Simply a recurrence tree or Fibonacci series complexity. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Theorem Let c1 and c2 be real numbers. Suppose that r2 − c1r − c2 = 0 has two distinct roots r1 and r2. Then the sequence {an} is a solution of the recurrence relation an = c1an−1 + c2an−2 if and only if an = α1r1n+ α2r2n for n = 0, 1, 2, . . . , where α1 and α2 are constants. Rishav Kumar Singh answered Jul 27, 2018 Rishav Kumar Singh comment Share Follow See all 0 reply Please log in or register to add a comment.