Question

The running time of an algorithm is given by t(n) = t(n-1) + t(n-2) t(n-3), if n > 3 = n, otherwise then what should be the relation between t(1), t(2) and t(3), so that the order of the algorithm is constant ?

Answer 1

Explanation:

The running time of an algorithm is given by: T(n)=T(n−1)+T(n−2)−T(n−3), if n>3 = n, otherwise Then what should be the relation ...