This is wonderful. Sir how simply you explain everything. My professor explains this topic in such a pathetic manner that i feel like I can never solve any master theorem question. But today I watched your video and everything became so easy. Thank you sir. I'm so grateful to you 🙏
for those who are asking N3 (cube) kaise aaya.... its actually n raise to(log base b a ) that is log base2 8 = 3 ... only log base b a value is substituted nothing else.. Hope its clear ;)
@@lvna1754 log₂8=3, it is reverse of exponent, think like this: 2 ki power KYA rakhne se 8 answer ayega ans= 2 ki power 3 rakhne se 8 ayega, so log of a (number) is just the power on the base to obtain that (number).
thnk u sir. bahut ache se explain kra apne... mere mind m jaise hi koi doubt ata h... aap agle hi second m usko bhi explain kr dete ho. god bless you sir
Mai ap key video dekta bad mai hu or like pehlay krta hu q k mujy pata hai k ap na sahi smjhaya hoga or ap hamesha sahi he smjhatay ho LOVE from Pakistan
Sir, thank you soooo much !! What my teacher could not explain in 2 hours, you explained here in 6 minutes. Please upload more problems with video solutions for practice also. Aur sir, aise hi har topic ko explain karna ! Good Job Sir!!
Aanchal Gupta haan.... U(n) is the function that is multiplied with n^log a base b.... and u(n) kaise Calculate karna hai vo sir bata chuke hai.... basically u(n) is also an input dependent function ...
By solved lots of examples i analyze one short trick... Solution : max[ n^log(a) base(b) , f(n) ] By this we can solve within a second... It will work in 99.99% examples (0.01% are exceptions examples)
THIS METHOD IS TOTALLY DIFFERENT FROM BOOK'S MASTER'S METHOD. IS THIS A SHORTCUT METHOD OF MASTERS THEOREM? SO,THIS IS ONLY FOR GATE MCQ SOLVING RIGHT?WE CAN NOT USE THIS IN COLLEGE EXAMINATION.
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 ?
Sir, in which reference will I find this approach for Master theorem? I have solved using these steps in my college exams but we weren't taught taking functions H and U.
Sir I wana to ask one question that is T(n) and U(n) are the functions or they have an an something other meaning.... So will u please clear this doubt to me.
sir playlist me sab similar lectures order me ker dijiye na dhundne me bohot problem ho rhi next video baar baar search kerna par rha hai wo bhi same serial numbers ke 2 3 videos hai :-( Abhi DAA me iss video ki playlist to mil gai but kuch kuch videos hai jinki bus serial number hai but koi playlist nahi.
Hi sir, great explanation. Just wanna point out that the question was T(n) = 8*(n/2)+n^2 because otherwise, it does not match with the formula. Thanks a lot anyway sir!!
If T(n) = 9T(n/3) + n, then using recursion tree method the answer should be O(n^2) and if using the form of mater method in CLRS, it is same but using your method it comes out to be O(n^3). Can you please explain?
![L-2.7: Recurrence Relation [ T(n)= T(n/2) +c] | Master Theorem | Example-2 | Algorithm](http://i.ytimg.com/vi/nNabmfua14c/mqdefault.jpg)
![L-2.7: Recurrence Relation [ T(n)= T(n/2) +c] | Master Theorem | Example-2 | Algorithm](/img/tr.png)
![L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | Algorithm](http://i.ytimg.com/vi/icS-e8RaCyo/mqdefault.jpg)
Cheers to this guy for saving us a day before our exam
True ⚡👍
*on the day of exam 😂😂😂🥲
@Roasterminator ban gaya cool chutiye jese comment karke
@Roasterminator indirectly unhe paise mil rhe hai
@@theabhish1 thoda sa milte hai bhai jitna wo kaam kar rha h utna nhi milte
This is wonderful. Sir how simply you explain everything. My professor explains this topic in such a pathetic manner that i feel like I can never solve any master theorem question. But today I watched your video and everything became so easy. Thank you sir. I'm so grateful to you 🙏
Sir you are doing a great work. It's helping many students like us to understand complex topics with ease. Plz do not stop this godly work. Thank you.
Literally a life saver!! Cant thank u enough 🙌🏻 THE BEST
That's really a very great kind of explanation.
@@psc_youtuber you're a fool
!
@@preetishpatel2306 u r nub
for those who are asking N3 (cube) kaise aaya.... its actually n raise to(log base b a ) that is log base2 8 = 3 ... only log base b a value is substituted nothing else.. Hope its clear ;)
Explain it in pleaseee
Same prblm 😢
n log 2 ^ 8 will be n^3 as 2^3 is 8
Answer kese aya 2^8=3 kese aya 😢
@@lvna1754 log₂8=3, it is reverse of exponent, think like this: 2 ki power KYA rakhne se 8 answer ayega ans= 2 ki power 3 rakhne se 8 ayega, so log of a (number) is just the power on the base to obtain that (number).
Sir you are just too good. You have simplified the concepts so well. Thankyou so much sir.
Thanks sir for making these videos for us.It takes a lot of effort to make these videos in a busy schedule.
Gate Smasher is best platform to study core sub related to get....ty gate smashers and obviously ty Varun Singla sir
Wah bade vaiya mauj kardi 🙏🙏 Itna aasan aur engaging tarikese concept koi nahi samjhaya
Thank You❤️❤️
this is the probably the best video to remember master theorem
thnk u sir. bahut ache se explain kra apne... mere mind m jaise hi koi doubt ata h... aap agle hi second m usko bhi explain kr dete ho. god bless you sir
Mai ap key video dekta bad mai hu or like pehlay krta hu q k mujy pata hai k ap na sahi smjhaya hoga or ap hamesha sahi he smjhatay ho
LOVE from Pakistan
The next day is my exam and I don't have any idea of any the subject...
But after seeing his lectures is giving me next level confidence 🙂
outstanding way to make us understand these difficult problem ,in a easy way.
thank you dada ❣️
Best teacher ever im able to do BCA just becz of ur videos and with good marks
Sir apke jaisa teacher pure country m nhi h apka video dekne k bad koi dusra video search nhi krna padta h!
n3 issliye hua kyuki Log 8 with base 2 == 2x2x2 = 8, 3 times 2 to get 8
i think it should be 4 because. loga^b= logb/loga
Thanks for this video to find the solution using master theorem.It is very useful for competitive exam.Thanks a lot.
aapko h ki u(n) and h(n) kya h?
Sir, thank you soooo much !! What my teacher could not explain in 2 hours, you explained here in 6 minutes. Please upload more problems with video solutions for practice also. Aur sir, aise hi har topic ko explain karna ! Good Job Sir!!
aapko h ki u(n) and h(n) kya h?
Aanchal Gupta haan.... U(n) is the function that is multiplied with n^log a base b.... and u(n) kaise Calculate karna hai vo sir bata chuke hai.... basically u(n) is also an input dependent function ...
Sir aap itna aacha padhatey hai man karta hai kiss kr lu aapko
your vedios are the best help 1 day before exam
thanks
Thank you sir Aapne meri problem solve krdi
aapko h ki u(n) and h(n) kya h?
bahut badhiya aadmi ho bhai aap!!! thnks a lot
Sir aap hum logo k lie kisi God se km nahi ho😊
what a explanation
THANK YOU SIR.
Thanks a lot very helpful to prepare for exams
General Query Solution: (if i
thanks for this
sir you are great ... thank you very much for the explanation
bhai ne kya samjhaya hai yaar.😍😇
Sir, you are my best teacher in my whole life❤️❤️❤️❤️❤️
sir incase logn has -ve power then which case to use ?
Wow, thanks sir😊
Easiest way to learn this topic... Thank you sir
Sir ur doing great work thank you so much 😊
really helpful , thank you so much sir
Nice work Brother ,
Thanks 👍
Kya machaya hai bhai tune
Gurujee shandar jabardast zindabad
mast padhaye bhaiya !!
thank you so much sir for making me understand this, I was not able to do this for a long time
By solved lots of examples i analyze one short trick...
Solution : max[ n^log(a) base(b) , f(n) ]
By this we can solve within a second...
It will work in 99.99% examples (0.01% are exceptions examples)
i can sense my brain cells increasing after watching this video
Sir too good explaination thanks for teaching.
Thank you Varun bhaiya ❤
what if h(m) = n2/n2 ? then it's n0 =1 , r=0 ! then which condition should i follow
that was Fabolus!!!!!!!!!!!!!!!!!!!!!!!..............Thnkxx
Thankyou sir for your explanation
Sir I have query that master method can also be solved without finding U(n) by using formula
Salam sir.... ma pakistan sa hun or mujhy app ki viD bht achy sa samj ati.... ALLAH PAK app ko izat dy or mazeed tarakee dy Ameen ❤
rajpoot kyun hai title me bhai . ye to hindu ka title hai
thanks sir love you hogya from sukkur IBA💓
wah yaar
Ohhhh bhaiiii bohatttt achyyy👍
Q.Write the advantage of TH-cam.
Ans. It helps to watch all the playlist of Gate Smashers and to get full marks in exam.
Thank you sir 🙏🙏
Thanks sir I stuck in this problems but your theory solved it 💯keep going sir👍🏻✨
Sir aapke videos dekh ke hamari mam padhati hai 😂 aur aapke diye questions se hi end sem ka paper banta hai 😅
Thank you sir for you teaching ❤
Abdul Bari sir is legend for algorithm.
Video is useful 👍
Excellent sir
Sir can you help me in this question
T(n) = 7 T(n//2) +3n^2 + 2
by master theorem.
∅(n^2.8)
it was very helpful....Thank you
Love from pakistan....you are one of the best
thank you so much sir ❤❤❤❤
Sir looks like Lawrence Bishnoi 😂😂
Change of variable recurrence relation bhi upload kar dijiye
Nice explanation 👏👏
Thank you sir ❤
My Lovely sir🍔🍟🍟🍔🍔🍟🍟🍔🍔🍔🍕🍕🍕🍕🥙🌯🌮🌭...From me n enjoy this 😋😋😋
This is wonderful. Sir how simply you explain everything
Thank you sir ji ❤
THIS METHOD IS TOTALLY DIFFERENT FROM BOOK'S MASTER'S METHOD.
IS THIS A SHORTCUT METHOD OF MASTERS THEOREM?
SO,THIS IS ONLY FOR GATE MCQ SOLVING RIGHT?WE CAN NOT USE THIS IN COLLEGE EXAMINATION.
After 3 hrs I will be in examination hall.
Great sir.super explaination.
Hail for this man 💯❤।।। 😌
Nice interpretation
Great sir ever
I generally don't comment, but you saved my gate exams!
Very easy to learn
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 ?
Thanks a lot sir!
Sir, in which reference will I find this approach for Master theorem?
I have solved using these steps in my college exams but we weren't taught taking functions H and U.
aapko h ki u(n) and h(n) kya h?
Sir, in my book the answer is in Theta notation and here in example we are using Big O. So what should be the correct answer?
No, don't write this method in your college examination.the method shown in video is only a short trick for gate exam.
Sir I wana to ask one question that is T(n) and U(n) are the functions or they have an an something other meaning....
So will u please clear this doubt to me.
T(n) is the time complexity function that we are calculating.... u(n) is another input dependent function
Can the master method be applied to T(n) = 4T(n/2) +n2log2n?
n^2 log base 2 multiple by n
Yes master theorm is applied here
🙏🙏🙏🙏🙏🙏super sir
In my college and in VBD book, first 2 condition you have given are opposite or exchanged
bhai nlog2 8 , n3 me kaise convert ho gya???
Superb sir g
Easy problem solving to difficult way sir n³ kaise a gya
T(n) = 8T (n/4)+ n² then what is the value of nlogbª
If i calculate in scientific calc log b power a then it’s showing 4.8
@@ShivanshPatel-gf8ti log8/log4 krna hoga that is 1.5 which is less than k(2)
how it will give n^3 value
sir playlist me sab similar lectures order me ker dijiye na dhundne me bohot problem ho rhi next video baar baar search kerna par rha hai wo bhi same serial numbers ke 2 3 videos hai :-(
Abhi DAA me iss video ki playlist to mil gai but kuch kuch videos hai jinki bus serial number hai but koi playlist nahi.
amazing sir! your kind of teaching is best then my university professor
Thank you sir...
Sir can u plzz tell the book name jisme ye aapka padhaya hua master theorem ka method likha hua hai....
Plz sir its very important!!
Thanks sir g 👍
Kindly make a video on recursion tree method
what is the criteria for any algorithm to be asymptotically faster than other algorithm (should we be comparing their best case or worst case)
❤❤❤
Hi sir, great explanation. Just wanna point out that the question was T(n) = 8*(n/2)+n^2 because otherwise, it does not match with the formula. Thanks a lot anyway sir!!
If T(n) = 9T(n/3) + n, then using recursion tree method the answer should be O(n^2) and if using the form of mater method in CLRS, it is same but using your method it comes out to be O(n^3). Can you please explain?
ANy idea will it be O(n^2) or O(n^3)
Sir I love you so much
What should we do if the value of h(n) is 1.It matches no cases..