edited by
498 views
1 votes
1 votes

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$
edited by

1 Answer

Answer:

Related questions

1 votes
1 votes
3 answers
1
Arjun asked Nov 5, 2017
839 views
Which of the following routing technique / techniques is/are used in distributed systems?Fixed RoutingVirtual RoutingDynamic Routing(a) only(a) and (b) only(c) onlyAll (a...
1 votes
1 votes
2 answers
3
Arjun asked Nov 5, 2017
911 views
The Sigmoid activation function $f(t)$ is defined as$\dfrac{1}{\text{exp} (t) + \text{exp} (-t)}$$t \text{ exp}(-t)$$\dfrac{1}{1+ \text{exp} (t)}$$\dfrac{1}{1+ \text{exp...