• edited by
34 views
1 1 vote

Solve the following recurrence relation 

$\mathrm{T}(\mathrm{n})=\mathrm{4} \mathrm{T}(\mathrm{n} / 2)+\mathrm{n}$

  1. $\mathrm{O}\left(\text{v}^{2}\right)$
  2. $\mathrm{O}(\mathrm{n} / 2)$
  3. $\mathrm{O}(\mathrm{n})$
  4. $\mathrm{O}(\log \text{n})$

     

Please log in or register to answer this question.

Answer:
Position:
Show:

Related questions

0 0 votes
0 0 answers
44
44 views
Shubham Sharma 2 asked Jun 28
44 views
A $\_\_\_\_$ is a pictorial depiction of the schema of a database that shows the relations in the database, their attributes, and primary keys and foreign keys.relational...
0 0 votes
0 0 answers
34
34 views
Shubham Sharma 2 asked Jun 28
34 views
Consider the following table of arrival time and burst time for three processes $\mathbf{P}_{0}, \mathbf{P}_{1}, \mathbf{P}_{2}$\[\begin{array}{|c|c|c|}\hline\text{Proces...
1 1 vote
0 0 answers
68
68 views
Shubham Sharma 2 asked Jun 28
68 views
According to Boolean law: $\mathrm{A}^{=}=$?$0$$\mathrm{A}$$\mathrm{A}^{=}$$1$
0 0 votes
0 0 answers
41
41 views
Shubham Sharma 2 asked Jun 28
41 views
Consider the following recursive function.int function (int x, int y) { if (y<=0) return x; return function $(y, x % y); }The above recursive function computes $...