PA of Algorithms Q8

0. The running time T(n), where (n) is the input size of a recursive algorithm is given as follows :
T(n) = C + T(n - 1); if n > 1
= d, if n ≤ 1
The order of the algorithm is

Answer
Comment
Array

Option : B
Explanation :

Forgot your password?

I agree with the Terms.