recategorized by
1,279 views

3 Answers

0 votes
0 votes
According to Master's theorem
T(n) =aT(n/b) + nc
a=2, b=2
nc = √n => nc = n1/2 => c=1/2
1. if logba < c, T(n) = Θ(nc),
2. if logba = c, T(n) = Θ(nc log n),
3. if logba > c, T(n) = Θ(nlogba).
Here logba > c, So T(n)= Θ(nlogba)= Θ(n1)= Θ(n)
Answer:

Related questions

1.4k
views
2 answers
2 votes
go_editor asked Jul 13, 2016
1,391 views
Suppose there are $\log_n$ sorted lists of $n \log_n$ element each. The time complexity of producing a sorted list of all these elements is (use heap data structure)$O (n \log \log_n)$\theta (n \log_n)$\Omega (n \log_n)$\Omega (n^{3/2})$
1.9k
views
1 answers
0 votes
Sanjay Sharma asked May 9, 2016
1,872 views
The time complexities of some standard graph algorithms are given. Match each algorithm with its time complexity ? ($n$ and $m$ ... -iv, c-i, d-ii}$\text{a-ii, b-i, c-iii, d-iv}$
2.3k
views
2 answers
2 votes
go_editor asked Jul 13, 2016
2,290 views
Let $\theta(x, y, z)$ be the statement x+y=z and let there be two quantification given as$\forall x \forall y \exists z \theta (x,y,z)$\exists z \ ... is trueI is true and II is falseI is false and II is trueI is false and II is false
3.1k
views
1 answers
1 votes
go_editor asked Jul 13, 2016
3,099 views
A* algorithm is guaranteed to find an optimal solution ifh’ is always 0g is always 1h’ never overestimates hh’ never underestimates h