1.

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

A. T(1) = T(2) = T(3)
B. T(1) + T(3) = 2*T(2)
C. T(1)-T(3) = T(2) A
D. T(1) + T(2) = T(3)
Answer» E.


Discussion

No Comment Found