Register

How to solve the following recurrence relation? I get confused when decimals are used in the expression.

348 views
0 votes
0 votes
$T\left ( n \right )= 8T\left ( \frac{n}{2} \right )+\left ( n\cdot logn \right )^{2.99}$

Also can $\mathcal{O}(n^{3})$ be an upper bound to above recurrence relation?
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

250
views
0 answers
0 votes
Purple asked Jan 26, 2016
250 views
How to remove recurrence relation when two or more are combined
What should be the approch to solve these relations?Consider the recurrence relation T(n) = T(n–1) + T(n/2) + n.Which of the following is a good tight upper bound on T(n)(A ... ;(n2 log n)(C) Θ(2 (log n)2)(D) Θ(n (log n)2)
User Avatar
20.6k
views
6 answers
1 votes
mohitrai0_0 asked Sep 28, 2018
20,611 views
Can we solve the recurrence T(n) = T(n/2) + 2^n by masters theorem, if possible?
I was wondering whether the recurrence T(n) = T(n/2) + 2n could be solved by using master theorem, and what would be the way. I tried solving the recurrence but can't. There is no mention to it in CLRS book. Please help. Thanks in advance.
User Avatar
1.7k
views
1 answers
3 votes
Prasanna asked Nov 26, 2015
1,674 views
Recurrence: How to approach
Solve RecurrenceA) T(n) = T( √ n) + Θ(lg lg n)B) T(n) = T(n/2 + √ n) + √ 6046C) T(n) = T(n − 2) + lg nD) T(n) = √ n T( √ n) + 100n
User Avatar
1.1k
views
1 answers
1 votes
mdboi asked Oct 29, 2022
1,114 views
how to solve T(n)=4T(√n)+3^5n with master theorem
how do i apply master theorem to this?
User Avatar
Link Copied!