PA of Algorithms Q25

0. Time complexity of an algorithm T (n), where n is the input size is given by
T(n) = T(n - 1) + 1/n, if n>1;
= 1, otherwise
The order of this algorithm is

Answer
Comment
Array

Option : A
Explanation :

Forgot your password?

I agree with the Terms.