Recurrence Relation T(n)= 2T(n/2) +n | Recursive Tree Method | GATECSE | DAA
ฝัง
- เผยแพร่เมื่อ 31 ม.ค. 2022
- Contact Datils (You can follow me at)
Instagram: / ahmadshoebkhan
LinkedIn: / ahmad-shoeb-957b6364
Facebook: / ahmadshoebkhan
Watch Complete Playlists:
Data Structures: • Introduction to Data S...
Theory of Computation: • Introduction to Theory...
Compiler Design: • Ambiguous Grammar | In...
Design and Analysis of Algorithms: • Design and Analysis of...
Graph Theory: • Introduction to Graph ...
t(n)=2t(n/2)+n recursion tree
#recursiontreemethodforsolvingrecurrences
#recurrence
#recursiontreemethodindaa
#recursivetreemethodforsolvingrecurrences
#recursiontreemethod
#recursivetreemethod
#recursivetreemethodtofindcomplexity
#recursivetreemethodtimecomplexity
![NONT TANONT - ดอกไม้ที่รอฝน (spring) - Reimagined [Live Session]](http://i.ytimg.com/vi/nY2PsFZFEOg/mqdefault.jpg)
Thanks for nice explanation sir ji
Nice Explanation Sir
Thanku sir ❤️❤️
Nice
Sir I watched your many videos and playlist
Your teaching skill is very good and sometimes it's better than trending youtube teacher also
Just add little bit smile 😊and don't stay serious 🥸 all over the the video, most of people don't like it and I thik that's the main problem your channel is growing slowly
Start with a positive chill voice ❤🎉
Thanks for your appreciation and suggestions...
@@THEGATEHUB🙏🙏🙏
the time complexity of both T (n) = T (n/2) + 2n and T (n) = T (n/2) + n is same or not please tell me
😮💨
Same
@@THEGATEHUB 😍