Rod cutting problem recurrence: T(n)=1+i=1nT(ni)=1+j=0n1T(j)T(n)=1+i=1nT(ni)=1+j=0n1T(j) T(0) = 0 Solution: T(n)=2^n
Fantastic news! We've Found the answer you've been seeking!
Question:
Rod cutting problem recurrence:
T(n)=1+∑i=1nT(n−i)=1+∑j=0n−1T(j)T(n)=1+∑i=1nT(n−i)=1+∑j=0n−1T(j)
T(0) = 0
Solution: T(n)=2^n
Related Book For
Discrete and Combinatorial Mathematics An Applied Introduction
ISBN: 978-0201726343
5th edition
Authors: Ralph P. Grimaldi
Posted Date: