2.4.1 Masters Theorem in Algorithms for Dividing Function #1

Masters Theorem for Dividing Functions
Explained All cases with Examples

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming

[temi]

This guy should be teaching all my CS professors.

[donnxayy]

Absolute legend. I couldn't see myself passing DSA without this man! Love how he stops and stares at me showing how simple it is.

[GS]

Usually other teachers show 2-3 examples in a 10-20 min video and this man has shown us every type of example in just 16 min. No doubt that he is a living legend for me atleast

[RahulKumar-djbt]

I have attended my M Tech class on Master theorem then repeatedly watched the M. Tech teacher's videos and also refereed the book but there was still something was not clear and it was like walking in dark tunnel ....Then I saw your video for 1 Hrs and thats it I can see the light. Now I am just checking the topics in book and directly opening your Videos ... You are my Guru ..Happy Teachers Day !!

[marcgomes]

Mr. Bari, you are probably one of the best teachers that I have seen on these difficult subjects. I have some of your courses on Udemy and they have helped me out so much. Thanks for your efforts.

[lupita]

At the beginning I was like how the heck am I gonna remember all this, then after a few examples, boom! You’re good at this!

[studywithrobin]

4 minutes in, I was still thinking "I don't understand, this looks even harder than how the professor explained it."

7 minutes in, I'm starting to see the pattern and get it. I'm not a traditional computer science student, so this really helps.

[abyk]

Mr. Bari you are absolutely the best in teaching Computer Science concepts. I wish all my professors were like you. Thank you so much for doing this for us!

[mohamadchadijamil]

i wish you were the professor for algorithms in my school

[mihir]

Using these videos after 5 years for my masters to revisit the topics in US is a treat. Thanks!

[nguyenson]

In case 3,
if p > 0 then O(n^k*logn^p)
if p <= 0 then O(n^k) //Add the equal sign down here
Same result, but feel better. At least for me.

[rathin]

8:57 should be O(n^2*log(n)) since it is case 2 sub-case 1 (p = 0 => p > -1)

[hassaanahmad]

I was allergic to this subject, you made me fall in love with it.

[abhishekbhagat]

I really thankful to you ABDUL BARI sir from the core of my heart. During 4 years of engineering in my college I was unable to get the concept of algorithm .then I started preparation for gate took coaching then also same with algorithm subject .but now I watch your videos and getting all the concept clear .and I also recommend my friends to watch your videos on algorithm to get the concept. May God Bless You.

[shanthoshable]

Thank you sir. I just finished my exam. It was because of your videos that I passed. Love from Australia ☺️

[邓成-gm]

Thanks Professor! You are the best! 我很喜欢你的作品！非常容易理解。

[superwendel]

8:58 "Directly put it here". You're the best Sir ! Great Lesson !

[adipratapsinghaps]

Perfect I have 4 years of experience and I never could relate mathematical functions with computer functions. You have changed my view. I think this will improve my DS & Algo skills. You are brilliant, yet simple.

[bijaykumarpun]

I'm not subscribed to this channel, but every time I'm recommended one of his videos, I just come to give a like and head back to what I was doing. I don't watch his videos anymore but I'll always remain grateful for how he helped me back when I was in college.

[rudrachobe]

Sir thank you too much I m doing my masters in the US and u are a better guru than people here.