This is best video on this topic I have seen. Our book is great if you have 5 years to ponder the theory of algorithms in your free time, but just tell me how to do the problem, and at least that way we are moving in a positive direction. You are good dude for making this. Thank you.
Great video!! Thanks so much! So: Case 1: If f(n) < n ^(log ᵦ(a)) then T(n) = O(n ^(log ᵦ(a))) Case 2: If f(n) = n ^(log ᵦ(a)) then T(n) = O(n ^(log ᵦ(a))(log(n)) Case 3: If f(n) > n ^(log ᵦ(a)) then T(n) = O(f(n)) plus check regularity condition
Thank's guy, this explanation is perfect for such slow-witted guy like me. Now I take the course of algorithms but understand very little from them. Now I understand a lot of master method and will be looking for other topics in your channel.
Thank you very much for this. It's very logical, easy to follow, and well explained without diving too much into unnecessary details. Very straightforward! Kudos to you!
This is a really good video on the topic that I was kinda iffy about though understood the general concept of it, it cleared up some of the confusion I had for it, it looks clean, the narrator is concise and unmuffled, well done
EXACTLY WHAT I WAS SEARCHING FOR SINCE AGES, best video on the subject of Master Theorem, I hope you make more videos regarding time complexity problems
Why can't my university class be really straightforward like this? my professor is usually making stuff extra hard to understand with unnecessary details we probably don't even need to know
Really great video, explaining simple and straight the master theorem! Thank you very much, it helped me a lot to understand it! Keep going my friend!! :)
This is best video on this topic I have seen. Our book is great if you have 5 years to ponder the theory of algorithms in your free time, but just tell me how to do the problem, and at least that way we are moving in a positive direction. You are good dude for making this. Thank you.
Damn right haha
thanks for this bro
CLRS?
It's been five years, how's your theory of algorithms coming along?
The best tutorial I have seen on this subject so far. Thank you!
Probably the best explanation I've ever seen. Most of these professors/videos just do the problem without any explanation.
This is absolutely the best tutorial on the master method I have ever found. I didn't understand it at all until I watched this. thank you.
This video is WAY better than any of the other ones Ive seen. WAYYY better, great work
3:30 rules
4:44 algorithm
7:16 task 1
9:19 task 2
11:22 task 3
thanks!
godly my guy, you know what its really about
how big r u, big fella? ;)
Great video!! Thanks so much!
So:
Case 1: If f(n) < n ^(log ᵦ(a)) then T(n) = O(n ^(log ᵦ(a)))
Case 2: If f(n) = n ^(log ᵦ(a)) then T(n) = O(n ^(log ᵦ(a))(log(n))
Case 3: If f(n) > n ^(log ᵦ(a)) then T(n) = O(f(n)) plus check regularity condition
Honestly this is such a helpful guide on how to solve Master's method problems! Thank you!
Thank's guy, this explanation is perfect for such slow-witted guy like me. Now I take the course of algorithms but understand very little from them. Now I understand a lot of master method and will be looking for other topics in your channel.
Best tutorial So far I found for the analysis of Master Theorem!! Keep it up
Damn good explanation......something as simple as explaining the comparison with the epsilon added or subtracted cleared up all of my confusion.
Thank you very much for this. It's very logical, easy to follow, and well explained without diving too much into unnecessary details. Very straightforward! Kudos to you!
Best video, with a step-by-step explanation. Thank you
This is a really good video on the topic that I was kinda iffy about though understood the general concept of it, it cleared up some of the confusion I had for it, it looks clean, the narrator is concise and unmuffled, well done
Honestly, thank you. Watched your video and was able to make sense of everything fairly quickly.
I was so confused when studying the master method in class until I watched this. Thanks!
Have an exam on this tomorrow and I figured it out 5 minutes into the video. Thank you so much
This is the best video of its kind on youtube, you're a great teacher!!
2 Hours University Lecture covering this < 16 minutes video XD Thanks a lot! I understand much more now!
This was so helpful! I'm prepared for my quiz tomorrow. :)
Good explanation and nice content. After watching your video I'm able to solve my assignment on the Master method.
wow , this explanation is much better than the one my lecturer in my collage gave me ! grate job .
EXACTLY WHAT I WAS SEARCHING FOR SINCE AGES, best video on the subject of Master Theorem, I hope you make more videos regarding time complexity problems
Best video on solving recurrences. I'm glad you made it!
you saved my life mate. thanks for a lifetime.
One of the best tutorial save my life
This was the best tutorial I've seen on this topic, Thanks a lot!
Thanks you! Much better than my lecturer!
A great tutorial on this topic, I finally understood it. Thanks for making this!
Thanks for your help, this video is the best explanation I can find on the subject. You deserve more views!
Thank you so much! Best tutorial on Master method by far. Love this step by step approach. You have made it look so easy with step by step.
thats was a damn good video! this is how I wish I was though the master method the first time
Nice example 1 I understood perfectly well. Good job man, thanks.
Got a test tomorrow and the masters theorem will definitely be part of it.
very well explained.. i could finish my assignment after watching this video. Thank you so much. God bless
Great explanation of Master Methods. Really helped me out!
Nice video! Even non-IT-guy ,as me, can understand the idea. Thank you!
Why can't my university class be really straightforward like this? my professor is usually making stuff extra hard to understand with unnecessary details we probably don't even need to know
you are the best, you made it very easy to understand. Thank you!
Best Video about the Master Theorem this video helped me two times now :D.
this is an awesome video for anyone to learn masters method . please post more videos like this!!
Thanks a lot man.... this is crystal clear explanation....
Very detailed explanation. Thanks so much
God bless you. This video is a LIFE SAVER! Thank you SO MUCH.
That's what I searched for! Thank you so much, you made this topic for me much easier than I thought of it previously. Cheers! :)
very clear, understood with no difficulty. thanks
I learned so much! thank you very much for taking the time!
You are a legend. Thank you!
Just amazing! Such great video !!! Really thanks! My best regards!
I read a chapter for one hour on master method, I really only learned it after watching this 16 minute video. Thank you.
The best tutorial so far. Thank you!
the best tutorial for masters theorem
Thank you Sir,for the clear explanation, awesome 🥰🙌
Crystal clear! Thank you.
Nice, actually helped me understand for my algorithms course -- thanks.
Exactly what I needed, thank you!!!
Thanks a lot, from a SCU student
Thanks for the tutorial. Is really helpful.
Awesome video! It helped me out a bunch
this was a fantastic explanation, thank you so much man.
Very good summary and guide! Thank you.
I understood this way better than the 1 hour 30 minutes I wasted in class
Really great video, explaining simple and straight the master theorem! Thank you very much, it helped me a lot to understand it! Keep going my friend!! :)
Currently studying for algorithms test! thanks!
Best tutorial ever
very good explanation! thank you for your work!
Du hast mich gerettet, danke dir!!
Very clear and easy to understand. Thank you.
thank you. Very helpful!
amazing tutorial on this subject. Thanks so much man!
Very Nyc Videoo Osm Osm Explaination
very clear! thank you for listing these steps!
solid tutorial. liked and subscribed
very well explained, thank you!!
Thanks! This was very helpful.
Great video:)) May I suggest you add an example where Master Theorem cannot apply to a particular recurrence relation?
Thank you!
Thank you so much this was incredibly helpful
thank you so much! that was very helpful
Thank you! best explaination!
Thank you this helped a lot!
17min > 1 college class
yea, no shit!
0:49 > 1 college class
17 min > 2 college classes in my case
amazing video, thanks
amazing! thank you!
This helped me so much, Thank you!
thanks , helped me alot.
Really helpful thanks
Eres un dios generoso
this video is amazing, thank you very much :)
Great job !
This is an awesome video!!!!!!!!!
great tutorial many thanks!
very helpful!!! Thanks.
systematic perfect explanation
Clearly tutorial, thank you for help me out :)
i really impressed thanks so much sir
good video, but at 11:00 it would be better if you submit some small value in ϵ and show how f(n) is still less than g(n).
Simply Perfect
Thanks a lot it was really helpful :)
Thank you very much!
Clear explanation
this is great