SUBSTITUTION METHOD FOR SOLVING ANY RECURRENCE IN HINDI || FIND TIME COMPLEXITY OF RECURRENCE
ฝัง
- เผยแพร่เมื่อ 17 ก.พ. 2020
- hello friends today our topic is recurrence by substitution method
basically there are two types of substitution method
forward substitution method and
backward substitution method
#substitutionmethodofrecurrence
In this video wo solve the recurrence relation by using substitution method
if you understand my video please like my video and subscribe my channel
Watched a lot of tutorials on this topic and found yours the most easy, clear and to the point 💯
Mam es topic ko TH-cam pe bahut hi famous channel se tutorial dekha lekin concept clear nahi hua lekin aapne sabhi doubt clear kar diye aapko one thousand time thank you.
i had watched alot of tutorials on this topic but you're video is more easier then other..really thanku you alot
Good job. Easy and straightforward explanation, good to refer instead of clumsy explanation in textbooks.
Nicely explained ,for those who are asking its forward or backward- It's a backward substitution method guys :)
No Introduction, let's get into the topic.
Good Explanation mam and I appreciate your work😎
It's indeed a very good explanation of the given topic. Thanks.
Waah! bohot shi...kya 1 baar mein samajh aaya✌🏻😊
18mins video far better than 1-2hrs cllg lecture
Yes
mashallah Madam.
WELL Teaching Skills You have
Mera kl DAA exam hai or mei thak gya tha kha se padhu or mera darr khtm hogya tha exam ka phir bhi pdhne baitha pr kuch bhi nhi mila last mei ye tutorial mila jiske vjha se lg rha hai pass hojunga THANK YOU FOR THIS TUTORIAL.(College ke teacher se accha hai explain kiya apne👍👍)
Hua kya fir pass
hua kya pass ??
Very clear and helpful ☺️
Very very helpful video mam
Thank you
Gjb bolne ka trika sath m solve ka
Very well explained thankyou 😊
Thank you ma'am for wonderful video 🙏🏻
Great keep working ❤️
You explained it very well thank you 😊
Your explanation so good thanks 👍👍
Thank you... App or bih video dhalo bht accha samjatiho appppp.
very helpful thanks 😀
best explanation so far.. :)
Nice Presentation 👍😊👍
Big Thank you madam 😊
thanks for the explanation
Nice and clear explanation.
Bilkul mam bhut psand aya apka vdeo
Explain very easy . very good explain
Thank you very much maam!!!!
Hi, what if i have 4T(n-1) -3T(n-2) +1 ?
That's helpful ma'am
THE BEST
what to do when the question asks for the time complexity of merge sort or something like that. How to solve that
really mene youtube pe boht saare videos dekh dale teh substitution method se related lekin the way you teach is brilliant thnk u and please make complete videos on desigh analysis of algorithm
Nice Thank you
Nice teach mam....
Hii...
New subscriber.
Top madam 👌
Awesome...
Mam T(n)=8T(n/2)+n ye problem ka general solution samaj mai nahi aaraha hai please explain
Good👍🏻
thank you mam ... :)
great explanation
Nice explaination
well explained
love from Pakistan
Very useful
Mam nice explanation it will help u a lot mam direct ga topic tomorrow exam
For me mam
Best explaination
Thanks slot😚
That helped
Amazing
Thank you mam
Please solve 2t((n/2)+16)+n by substitution method it's urgent🙏🏻
Can u explain forward substitution method same example
Thanks
Ma'am aap bhut aache se explain krte ho❤️🥰
Love you mam
Nice way of teaching 👍
tq
kya acche se explain kiya , i have watched it on 2x the concept i was not able understand after watching 1 hour lecture understand on just 17 minutes, thank you so much mam.
Ma'am, how did u get n/2^i =1?
By using base condition which is given in question
Can I refer to your video for ME of subject algorithm and complexity
Yes of course
Excellent, now let me try some problems.
is there any difference between substitution and itretration method? 🙄
Found the answer??
Yes there is difference but there are pretty much the same it makes confusion
Method is slightly different
@@ghost2005 bruh
G 132
Yeh backward substitution hai kya
heart
'
At 17:04 Ye equation kaha sy derived ki?.🤔
Sum of n terms ka formula hai
the solution for solving the first question by masters method is theta(nlogn) ,but you are getting O(nlogn) which one is correct?
But ma'am apne to first me guess kra nhi
It's Iterative method not substitution
Dumb its correct
@@vandanthakar7076😂😂
mam formula ki use kardao ho
reeeeeeeeeeeeeeeecurence
lmao aren't you from amity university rajasthan
aa gaya fir se
Ma'am solution ko verify nehi Kiya using Mathematical Induction😢
n/2*n/2 = nsquare/4, why the hell there is n only
Easy example solve kr dete hai bss complex example solve hi ni krte
not understand clearly
algorithm is too difficult for us watch this vedio 3 time but still not clear sorry
😰😰😰😰
Thank you mam