621 views

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 this algorithm is

1. $n^{2}$
2. $n^{n}$
3. $n^{3}$
4. $n$

Using masters theorem o(n^3)

1 vote