Recurrence Relation T(n)= 3T(n/4) +n^2 | Recursive Tree Method | GATECSE | DAA

Contact Datils (You can follow me at)

Watch Complete Playlists:

t(n)=3t(n/4)+n^2 recursion tree
#recursiontreemethodforsolvingrecurrences
#recurrence
#recursiontreemethodindaa
#recursivetreemethodforsolvingrecurrences
#recursiontreemethod
#recursivetreemethod
#recursivetreemethodtofindcomplexity
#recursivetreemethodtimecomplexity

[sinx]

Trying this problem for 1 week. Searched on google, youtube, chatgpt and more places. But I was'nt able to solve the problem. Because no one....NO ONE mentioned the thing you mentioned at 10:38. Thanks to you now I am able to solve this and similar kind of problem. And sir, all the credits goes to you. Tomorrow I have an exam on this topic out of 10 marks. I will make sure to inform you here what score I got because of your help :)

Once again Thank you so much sir ❤

[G.T]

Sir, you are making a mistake in your recursive tree videos, the mistake is that only count the total sum of cn^2 multiples(f(n)) multiples) at each level, but at the leaf nodes, you also need to count the cost of leaf nodes, i, .e T(n/b^k) * a^^(log b n), where b is base. Answers have been correct only because the leaf node sum usually doesn't dominate, please look into this.

[nitishkushwaha]

Adding size of all subproblems we should get the size of original problem, but here adding size of all subproblems we get 3n/4 which is not equal to n.. please clarify!!

[jpvikash]

I think there is something wrong to selection of root value....

[CodingMan-fv]

Pls. Make the videos on dynamic programming questions series with code

[mayankpatel-li]

sir phir k ku nikala jab zarurat nahi thi?

[codewithharis]

Bro can you give me solution of these questions using tree method
a. T(n) = 4T(n/2+2) + n

c. T(n) = T(n-1) + T(n/2) + n

[sharmavasundhara]

So when you say - we're going to combine n/16, n/16, n/16 - at level 2 - what does that mean?

I have recently started learning algorithms and I'm a bit confused about how to exactly draw these recursive trees. I saw a bunch of your examples and I'm not able to understand how we exactly combine the subproblems to get their individual complexities. Would be great if you can help! Thank you ✨

[captain]

Can you please tell what is the time complexity of 4t(n/2)+n I'm just little confused in substitution method 😢

[MaryamMasood-oo]

16 ka square is not 64 plz correct the question

[Hansly_rz]

I don't know anything he said but I somehow understood it

[NidhiGupta-thde]

In denominator there is, 4^2,4^2,4^3...

[Anushka]

aap thoda clearly bola kro bohot dheere bolte hai aap smjhne ke liye ki kya bola 1x pe dhyan se sun na padta hai ruak rauk ke

[lrcnature]

n/4 are three part devided into n/12, n/12, n/12😂🤣😂😂🤣