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

Posted Date: