When u said “this is masters theorem” after writing few conditions.....even master theorem itself in shock, I made this look so complex to even university professors and this guy is making fuN of me.....lol. GOD BLESS U....
@@siz1858You can compliment someone's work like this, if it's been done by the person passionately and beautifully. Take the metaphorical meaning; not everything needs to be taken literally.
I have never seen anyone dedicating 30 odd videos for explaining the complexity of the algorithms. Thanks to you sir, this is the best use of youtube I have ever done till date.
Our teacher took 3 hours to teach these topics, but also after that no one was able to understand these clearly. But here you made it clear within a 8 minutes of lecture. I can't thank you enough.
I was almost crying from how much work I had to do for my class and my professor didn't explain this topic that much and it's a crucial topic we need to understand. This video has helped me so much THANK YOU!!!
I can say it's the MOST complete and easy to understand playlist. Just couldn't understand this Master Theorem before but with you I got it. Respect to you sir
Its most simplified video exist on Master Theorem first observation then going through making the cases is just Lit i remembered very easily by writing on myself in the first go tysm
I have watched so many videos but after all I have to learn master's theorem but now I watched your sir this totally change my way of learning, you explained in that way there is no need to learn it you can derive it by yourself. Thank you so much sir!
Thank you so much sir... i had pretty much hatred on DS & Algo .. but after watching your video everything is much easier and fun to learn ... thank you so much from bottom of my heart ... you are my saviour
After watching one recurrence relation video i thought of skippin the rest ...but you explained each and every concept like our teachers do in our elementary school(spoon feeding) which made me not to skip atleast one lecture on this. Thanks for last minute preparation.
The moment I realise my childhood was a lie 🤥🤡 06:36 😭😭😭 Now it's 12 mid night and I don't know whom to I can share my eureka moment. After writing multiple exam over this same topics now only I realise that masters theorem is this simple🎉😢
00:07 Masters theorem is not applicable for decreasing functions 01:38 The recurrence relation has a general form. 02:24 The general form of recurrence relation is f(n) = n^k. 03:22 The main point is that F(n) is in the form of N power K+1. 04:17 The function F(n) is given by n power K plus 1 05:17 The formula for calculating F(n) is F(n) = 3^n * (n^k) * a^(n/2) 06:19 Three cases explained for n power K 07:28 Master theorem helps solve recurrence relations.
I have a lot of confusion while solving coding problems, but after seeing this video all doubt clearly related to time complexity in dynamic programming.
6:08 as far as I know it is illogical to have a < 1. It might be mathematically be correct but it is not possible. So if someone asks you such questions, rather than solving it prove it and them wrong.
Hello sir !!! Thanks for your videos and it's great way to learn algorithms from this channel. May God bless you with good health and wealth.. I have a doubt in solving the relation T(n) = T(n-1)+T(n/2)+n where n >0. Here should the f(n) be taken as n or as T(n/2)+n. How to solve this relation? Thanks in advance.
May Allah bless you. This is golden video and they are free. Priceless contribution to CS by A true legend. In the Best Universities isn't explained like that.
![L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm](/img/n.gif)
When u said “this is masters theorem” after writing few conditions.....even master theorem itself in shock, I made this look so complex to even university professors and this guy is making fuN of me.....lol. GOD BLESS U....
Hahahahhahahaha
haha
That's exactly how i felt when he said that XD
I can't explain to you how helpful these videos are to me. Thank you.
Me to
Tommorrow is my sem xam. And these are really helpful for me as compared to other youtube channels
dont explain
Angel has come down and explains the impossible things.....
100%
True🙌
True ❣️
Cringe
❤
Wow!.. Never seen someone explain master's theorem so beautifully and passionately
Bro do you a crush on him? That’s not how you compliment a person's explanation
@@siz1858You can compliment someone's work like this, if it's been done by the person passionately and beautifully. Take the metaphorical meaning; not everything needs to be taken literally.
I have never seen anyone dedicating 30 odd videos for explaining the complexity of the algorithms. Thanks to you sir, this is the best use of youtube I have ever done till date.
Our teacher took 3 hours to teach these topics, but also after that no one was able to understand these clearly. But here you made it clear within a 8 minutes of lecture. I can't thank you enough.
Mine used 2 mins, na ogun go kill en papa
I was almost crying from how much work I had to do for my class and my professor didn't explain this topic that much and it's a crucial topic we need to understand. This video has helped me so much THANK YOU!!!
Sir, massive respect to you.
I have never understood Master's Theorem in my college class. But thanks to you.
Regards,
Saurav
You english is so fluent and easy going👍
This guy is a GOD level teacher lol. Big thanks to U
Yup, bought his DS course on Udemy. Those are great!
Greetings from America, and thank you very much! Your videos are some of the best I've seen. 🙂
Mind-blowing explanation!! I used master's theorem for over an year, but never observed these subtle things. Wonderfully proved with examples.
Sir, you're true genius in teaching. Some people will only ignore it because of the thumbnail or your get-up. Your contents are gem.
I can say it's the MOST complete and easy to understand playlist.
Just couldn't understand this Master Theorem before but with you I got it.
Respect to you sir
Never come across such a Simple and Beautiful explanation so far. Further, the way to memorize the formulae is Fantastic.
This made Master's theorem make sense!! Thank you, thank you!
Its most simplified video exist on Master Theorem first observation then going through making the cases is just Lit i remembered very easily by writing on myself in the first go tysm
Sir, you are the great Algos tutor that I have come across so far. I am greatly inspired by your humility and patience.
The more times you see his videos the clearer and concise it becomes hats off
The world is a much better place with professors like you!!
Hats off sir !!! for your simplicity and explanation, I had never seen some explaining like this.
nothing short than legendry explanation. this series is the benchmark of algo teaching
I have watched so many videos but after all I have to learn master's theorem but now I watched your sir this totally change my way of learning, you explained in that way there is no need to learn it you can derive it by yourself. Thank you so much sir!
Thank you my friend , LOVE FROM ROMANIAA !!!!
Its easy to understand this video because you related masters theorem with previous videos very nicely winded up recurrence relation. Thank you sir.
thank you so much sir . this is just what we need .its my last subject to prepare for gate 2021 and i can say its going well thanks to you..
Thank you, sir! I've been recommending my friends to watch your videos, You're excellent!
This is the best explanation of Masters theorm I have ever seen
Thank you Abdul you're a fantastic teacher! Way better than my own teacher that just reads the slides...
Thank you so much sir... i had pretty much hatred on DS & Algo .. but after watching your video everything is much easier and fun to learn ... thank you so much from bottom of my heart ... you are my saviour
You sir are amazing! You're making these computer science stuffs very easy. Please continue making these videos. Thank you!
You are the boss and best teacher i have seen on this topic..Lots and lots of love and respect
💚💚💚💚🙏🙏🙏🙏🙏🙏
you are best teacher on youtube, you make difficult consepts easier.
This video is the world`s best explanation of reccurence relations! Thanks to you!
I dont have any word to say how good i feel from your lecture
Your teaching skills are God level 🙏.
you have saved our life..may god bless you sir.
Salute you sir. I have not seen a teacher in DS like you. Superb.
After watching one recurrence relation video i thought of skippin the rest ...but you explained each and every concept like our teachers do in our elementary school(spoon feeding) which made me not to skip atleast one lecture on this.
Thanks for last minute preparation.
welcome ashok
@@Secret49999 Thank you SAP labs
Master's theorem by one of the masters' of the subject !! #GOD_LEVEL
No one has explained masters theorem better this :D
now master theorem become the child theorem for me . What a nice explanation
Your videos are a lifesaver for computer science students. Thank you sir for this wonderful explanation. 🙏🙏🙏
excellent video sir! tomorrow is my exam and you cleared all the 5 mark questions of masters theorem at one go!
Bro you saved my life. God bless you !
God level explanation...your english accent is so fluent and easy to understand
GOOD not god friend
this is the best ever master theorem lecture or this is the only lecture for master theorem ...thank you very much sir for this mind blowing video...
No any other can explain as you can...👌👌👌👌🙏🙏🙏🙏
Sir, your videos are amazing. Truly high quality stuff. Many Thanks
I can't explain how well you have described this topic.
Thank you so much sir. I do not know how to appreciate you, have no words to mention.
Sir, You made us Master this theorem!
U made MASTER Theorem a piece of CAKE.. Just loved it.💖💖
The moment I realise my childhood was a lie 🤥🤡 06:36 😭😭😭 Now it's 12 mid night and I don't know whom to I can share my eureka moment. After writing multiple exam over this same topics now only I realise that masters theorem is this simple🎉😢
dhanyawad sir ji aapka dm sahu
sir it jas cleared the doubts of YEARSS.. simply superb concepts explained that too in easiest way...
amazing explanation tomorrow I have an exam I was going through many pdf on internet by chance came here your explanation is awesome
For t(n)=2t(n-1)+ n solution comes out to be O(2^n) and not as the formula predicted
😮this is my reaction when i saw it♥️
00:07 Masters theorem is not applicable for decreasing functions
01:38 The recurrence relation has a general form.
02:24 The general form of recurrence relation is f(n) = n^k.
03:22 The main point is that F(n) is in the form of N power K+1.
04:17 The function F(n) is given by n power K plus 1
05:17 The formula for calculating F(n) is F(n) = 3^n * (n^k) * a^(n/2)
06:19 Three cases explained for n power K
07:28 Master theorem helps solve recurrence relations.
Your Explanation is Great !! understood very clearly .... Many Many Thanks Sir
Thank you very much sir. Even our university teachers also follow you.
kamal ha kamal ha . mari sari problem hi
solve kar di
Great Knowledge i achieved sir.
Thankyou so much sir☺🙌
Very Precise ! Nice Lectures Sir :) Doing A Grt Job
6:35 this is master's theorem. MIC DROP
This guy is so sorted out.
The Gem, thanks for being here sir.
here are many guides but you are excellent .. thank u so much sir..bt there is 1 req plz upload the playlist on programming & data structure
This is awesome !!!
Thank you very much. You are a genius. 👍👍🙏🙏👌👌🔝🔝
Thank you so much. The whole series is just beyond amazing.
Outstanding explanation.
6:56 masters's theorem notes;
So simplified. Thank you!
finally i understood master's theorem
Thanks sir,love from Bangladesh
Weekend over and back to Abdul's Sir class.
😊
I have a lot of confusion while solving coding problems, but after seeing this video all doubt clearly related to time complexity in dynamic programming.
thanku sir your explaination is just outstanding
Thank You very much sir🥳🥳🥳🥳🥳🥳🥳
Excellent progression and crystal clear content. Thanks!
watching in 2024, with paper in the morning. . . .very helpful
Thank You So Much Sir.😀
For Making Tough Subjects Easy To Learn.👍😄😊
Best ever explanation Sir
*Master’s Theorem* : 6:37
Such a great teacher you are Sir! Awesome!!
am i watching a movie or studying ? i am enjoying it so much
Thanks sir
God bless you 🙏🙏🙏🙏
6:08 as far as I know it is illogical to have a < 1. It might be mathematically be correct but it is not possible.
So if someone asks you such questions, rather than solving it prove it and them wrong.
Badia explain Kiya h
Very nice
Thanks 🙏🙏
best explanation out there
Holy stuff! These are great videos
Hello sir !!! Thanks for your videos and it's great way to learn algorithms from this channel. May God bless you with good health and wealth.. I have a doubt in solving the relation T(n) = T(n-1)+T(n/2)+n where n >0. Here should the f(n) be taken as n or as T(n/2)+n. How to solve this relation? Thanks in advance.
Great job😍
Bohot mast samajaya hai
Now the speed that I am watching is 1.75, and I still get the same clarity. Awesome work! Thank you.
Very helpful, sir.
Best Explaination
May Allah bless you. This is golden video and they are free. Priceless contribution to CS by A true legend. In the Best Universities isn't explained like that.