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
| A. | n2 |
| B. | nn |
| C. | n3 |
| D. | n |
Answer : C Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
