L-2.10: Recurrence Relation [T(n)= 3T(n/4) +cn^2] | Recursive Tree method | Algorithm

►Design and Analysis of algorithms (DAA) (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

[Mahnoor-ndqb]

Last week, a day before my DAA quiz I watched your video and practiced the tree recursive method. And guess what I had the same question in my quiz. Got full marks on my quiz. Came back to say THANK YOU!

[mehtabahmed]

Never thought DAA can be completed in a week. Thanks Sir.

[creativitypoint]

Finally, I completed the whole playlist for DA. Thanks a lot! I watched every video and solved every question by myself and now I am confident enough to go for the next step in my journey of being a best programmer and a Software Engineer.

[peralacharanraj]

Finally DAA complete playlist completed successfully
Thanks alot sir 🙏

[nishah]

Last case mein..we went upto height of a tree but here we didn't..why pls explain

[gauripawar]

Thank You Soo Much Sir🙏🙏Because Of Your Teaching My Weakness Becomes My Strength😇😇

[shiprarathore]

You did a great job. I learnt a lot. Teaching method is very efficient and accurate. Can you please make video on radix sort, bucket sort, counting sort, randomized quick sort also.?. Thank-you

[sangdilbiswal]

why did you not take the height of the tree instead you add all of them to infinity, I mean the process will terminate once it reach 1 and not infinity?
PLEASE ANSWER

[hritikranjan]

sir but the height of the tree is log (base4) n. So the complexity will be O(n^2 log (base4) n). As you have done in the previous video of recursive tree method. Am i wrong?

[pkrkajdjasdljskjdjsadjlaskdja]

finally i got some proper video after 5/6 video watched

[khanfahad]

Thanks sir I am looking for this topic

[SarthakKumar]

Sir, please make a video on n queen problems. and thank u for excellent and easy❤ explanations

[anickkhan]

Sir please give this course highest priority. Please sir.

[puspaulmukhopadhyay]

How can u take a infinity series ... When height is constant ( and that's order or log4(n) )
I don't think the ans is correct !!
Plz reply, bcoz it may damage all my concepts.

[Mad_Monk]

why infinite gp, no. of terms should be equal toheight of tree which is log4(base)n

[mdshakirhussain]

Consider the following recurrence relation.

T(n)\left\{\begin{array}{cc} T(n / 2)+T(2 n / 5) & \ { if } n>0 \\ 1 & \ { if } n=0 \end{array}\right.

Which one of the following options is correct? 


make video on this problem please guru g
#gatesmashers
@gatesmashers

[ishanbasketball]

Sir I 'm really interested in computer networks and loved ur playlist on that . Can u also tell us which book to refer to study computer networks which includes ur video content

[KJ__AI]

Please remove the extra set of brackets ⌊n/4⌋. It resembles the floor function and is a cause of confusion.

[lakhveer]

T(n) = b T(n-c) + f(n) 😭😭sir isko kaise kre.. College wale pta ni kya pa dete hai exam mein 😅

[deepikadagarharyana]

Sir plzzzz ugc net k liye bhi kuch kara do ...pyq hi karado solve ..aapka tarika best h samjhane ka mahina h exam ..if possible 🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌