in Unknown Category edited by
494 views
1 vote
1 vote

Consider the recurrence relation:

$\begin{array}{} T(n)& =8T \bigg( \dfrac{n}{2} \bigg) + Cn, \text{if } n>1 \\ & =b, \text{if } n=1 \end{array}$

Where $b$ and $c$ are constants.

The order of the algorithm corresponding to above recurrence relation is

  1. $n$
  2. $n^2$
  3. $n \lg n$
  4. $n^3$
in Unknown Category edited by
by
494 views

1 Answer

0 votes
0 votes

Answer is Option (D) - n^3

Solution is attached here.

Answer:

Related questions