reopened by
860 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$
reopened by

Please log in or register to answer this question.

Answer:

Related questions

1 votes
1 votes
1 answer
1
0 votes
0 votes
1 answer
2
admin asked Apr 1, 2020
683 views
The solution of the recurrence relation$a_{r} = a_{r-1} + 2a_{r-2}$ with $a_{0} = 2,a_{1} = 7$ is$a_{r} = (3)^{r} + (1)^{r}$$2a_{r} = (2)^{r}/3 – (1)^{r}$$a_{r} = 3^{r+...
0 votes
0 votes
1 answer
3
admin asked Apr 1, 2020
914 views
An algorithm is made up pf two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then the order of algorithm is$max(f(n),g(n))$$min(f(n),g(n))$$f(n) + ...
2 votes
2 votes
2 answers
4
admin asked Apr 1, 2020
847 views
The average search time for hashing with linear probing will be less if the load factorIs far less than oneEquals oneIs far greater than oneNone of the above