Queues Q.63

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 Where p,q are constants. The order of this algorithm is

Answer
Comment
Array

Option : C
Explanation :

Forgot your password?

I agree with the Terms.