PA of Algorithms Q7

0. The running time of an algorithm T(n) where (n) is the input size is given by
T(n) = 8T (n/2) + qn, if n > 1
p, if n = 1
where p, q are constants. The order of the algorithm is

Answer
Comment
Array

Option : C
Explanation :

Forgot your password?

I agree with the Terms.