in Algorithms reopened by
621 views
0 votes
0 votes

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$
in Algorithms reopened by
621 views

2 Comments

Using masters theorem o(n^3)
0
0

Please log in or register to answer this question.

Answer:

Related questions