Perfectly explained sir you should also deal with that why we can't use case 1 while solving problem on case2 it will make the understanding more clear
One of the technicalities of this theorem is that for f(n) = omega(n^(logb(a+epsilon))), f(n) must be smaller than n^(logb(a)), and it must also be polynomially smaller and satisfy that a*f(n/b)
Problem with this course is the confusing use of f(n) on proving side and representing the function side. Some would refer f(n) as c, or d. And the epsilon exist only to prove that it satisfy the conditions, which is utterly unnecessary in the notion that if the values of f(n) is positive and not negative.
Can u please check: for example 3T(n/3) + n^2. so we have „case 3“ and we checke different between f(n) und Omega ^y+є. f(n) = 2 , Omega = 1. but 1+є , for є=0.1. so f(n) = 2 > 1.1 . It’s true what I mean and try to solve ?
If you have a time complexity in theta (a tight bound), then you already know possible solutions for upper (Big O) and lower bound (Omega), because theta bounds in both directions
My Teacher taught this in three Lecture and I have understood nothing.
After watching 20 min video ....all concept cleared...hats off to you sir.💯💯
No lecture could ever explain it as well as you did! Thank you for sharing this great video, definitely subscribing :)
i have watched a lot of videos but this is the only one which made me understand this hard concept thanks for your effort
You, sir, can explain very well! Suddenly, I'm not scared anymore of solving recursions using MT! :D Thank you
I realize I'm kinda off topic but do anybody know a good place to watch new series online ?
Thank you very much. Your video helped me immensely with my studies, didn't understand it during the lecture😊
Best lecture🎉🎉🎉🎉🎉
You are so good at explaining these things. Thank you for the videos.
You are really good at teaching. Your videos are helping me a lot with my algorithm course.
Perfectly explained sir you should also deal with that why we can't use case 1 while solving problem on case2 it will make the understanding more clear
veoma dobar klip
Amazing Explanation! very good!
Glad you liked it!
why only theta
I love how you say that 3:19
Professors: "I'm the best!"
Private Tutors: "No, I'm the best!"
Indian guy on RUclips: "Amateurs..."
i really love your explaination you clarify everything , i hoped that i ve discover this channel 4year ago.
and only now i can hit the like button , great job
16:30 you mentioned nlgn grows faster than n. Do we have to define that n>=2 in this case? What would happen between n>0 & n
One of the technicalities of this theorem is that for f(n) = omega(n^(logb(a+epsilon))), f(n) must be smaller than n^(logb(a)), and it must also be polynomially smaller and satisfy that a*f(n/b)
I think it's practically trivial. As the asymptotic notation used is already implying that we're dealing with a very large number.
Very Well explained♥️
From Pakistan🇵🇰
EXCELLENT EXPLAINATION
thnx you a lot sir 👌
Great explanation dude keep it up
Master instructor. Wonderful!
great explanation
Sir do you have a derivations video for this?
Thank you ! Really helped me to understand it.
great sir....this video made master method so easy..thank you
Can I just check for case 1 and 2 and if it doesn't satisfy go for case 3?
No, because it is possible that the Equation doesn't satisfy any of those 3 cases.
@@timweissenfels5353 yeah I figured that during my test lol 😂
Thanks :)
@@krishcshah No problem
thanks for this video
Problem with this course is the confusing use of f(n) on proving side and representing the function side. Some would refer f(n) as c, or d. And the epsilon exist only to prove that it satisfy the conditions, which is utterly unnecessary in the notion that if the values of f(n) is positive and not negative.
wonderful
Very nice explanation
very clear and step by step explanation, you're very good.
excellent video
which software you are using for writing?
Could you recommend any book or exercises guide to solve asymptotic notation problems? I'd deeply appreciate any suggestion. Thanks in advance.
Steven Skiena's book ADM is also good, especially Graphs. It also has Part 2 section where it addresses common problems.
and the stipulation that f(n) is an asymptotically positive function
Awesome explanation!!! U made it very simple... Thank you
Thanks for this amazing explanation...:)
nice video
thank you
2 months into 1 video very good
perfectly explained
thank you so much
Thank's a lot man, it was very clear and helpful!
Sir, how to identify which equation goes to big theta, o or omega. I didn't get that. Please help me sir
Using extended master theorem
Thanks a lot sir ji
Can u please check: for example
3T(n/3) + n^2.
so we have „case 3“ and we checke different between f(n) und Omega ^y+є.
f(n) = 2 , Omega = 1. but 1+є , for є=0.1. so f(n) = 2 > 1.1 . It’s true what I mean and try to solve ?
Thank youuu
You're welcome!
why not the example given with case 2 doesn't solve with case 1? it satisfies the case that f(n)=1=O(1). so T(n) can be ፀ(1)
wonderful wonderful video you saved me so much time bleh bleh bleh
ありがとう
T(n)=2T(n/2)+2^n
whether it can be solved using master theorem?
Yes.
The answer would be -
Thetha (2^n) (means 2 raise to power n )
sir if we want to find the both upper and lower bound then how this maser theorm would help? as it is giving time complexity in theta!!
If you have a time complexity in theta (a tight bound), then you already know possible solutions for upper (Big O) and lower bound (Omega), because theta bounds in both directions
I want to know about the software that you use as a board here, please let me know about it. :)
Ink2Go
@@GATEAppliedCourse thanks!!!
bullshit