NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 14

Question

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

• A. $n^{2}$
• B. $n^{n}$
• C. $n^{3}$
• D. $n$

Comments

Using masters theorem o(n^3)

---

https://gateoverflow.in/336928/Nielit-2017-oct-scientific-assistant-a-cs-section-c-4