SUBSTITUTION METHOD FOR SOLVING ANY RECURRENCE IN HINDI || FIND TIME COMPLEXITY OF RECURRENCE

[@mr_rawat]

Watched a lot of tutorials on this topic and found yours the most easy, clear and to the point 💯

[@ashishchaubey4649]

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👍👍)

[@Forexx_boy]

Hua kya fir pass

[@yaardixit9809]

hua kya pass ??

[@AmneetKaur_]

i had watched alot of tutorials on this topic but you're video is more easier then other..really thanku you alot

[@codinglovers-lm5mf]

Nicely explained ,for those who are asking its forward or backward- It's a backward substitution method guys :)

[@chiragrachchh1264]

Good job. Easy and straightforward explanation, good to refer instead of clumsy explanation in textbooks.

[@sameerborkar3803]

18mins video far better than 1-2hrs cllg lecture

[@SaifTrader306]

Yes

[@hariommaurya3014]

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.

[@abhishekpatelspace]

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.

[@mr.incognito8426]

No Introduction, let's get into the topic.
Good Explanation mam and I appreciate your work😎

[@Hemant_Kumar_09]

Waah! bohot shi...kya 1 baar mein samajh aaya✌🏻😊

[@deependrapratapsingh1399]

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

[@Sandeep-vk6fj]

Explain very easy . very good explain

[@HanzalahMian]

very helpful thanks 😀

[@bhuvneshjangid9138]

Very very helpful video mam
Thank you

[@B.prakash483]

Mam nice explanation it will help u a lot mam direct ga topic tomorrow exam

[@B.prakash483]

For me mam

[@shubhamanand4074]

It's indeed a very good explanation of the given topic. Thanks.

[@funtush211]

mashallah Madam.
WELL Teaching Skills You have

[@nituM-o1j]

You explained it very well thank you 😊

[@eneshkaneshk380]

Bilkul mam bhut psand aya apka vdeo

[@talalsallmart1]

Best explaination

[@rishabhpandey12aroll7.5]

Nice and clear explanation.

[@thewonderfulvoice9907]

Thank you... App or bih video dhalo bht accha samjatiho appppp.

[@husnainiqbal5997]

best explanation so far.. :)

[@skillboosters]

Great keep working ❤️

[@smanvision]

Nice teach mam....

[@khushbuchoubey8156]

Ma'am aap bhut aache se explain krte ho❤️🥰

[@ib_raheem_pathan]

Love you mam

[@priyanshu_dwivedi1733]

Nice way of teaching 👍

[@inascharan]

thanks for the explanation

[@bharath3238]

THE BEST

[@nandanbanerji8309]

Awesome...

[@Selectpur_Official]

Gjb bolne ka trika sath m solve ka

[@cheenu2064]

great explanation

[@muhammadmansha3327]

Your explanation so good thanks 👍👍

[@krishnakumaryadav1852]

Good👍🏻

[@jaswantkhatri8211]

Thank you ma'am for wonderful video 🙏🏻

[@Marcos_Vikas]

Very well explained thankyou 😊

[@sayantandey6614]

Nice Presentation 👍😊👍

[@harshgupta6803]

Big Thank you madam 😊

[@rahulshaw7457]

Very clear and helpful ☺️

[@karthikbandi8211]

Excellent, now let me try some problems.

[@lalit_096]

thank you mam ... :)

[@surnerpriyanka8955]

Mam T(n)=8T(n/2)+n ye problem ka general solution samaj mai nahi aaraha hai please explain

[@merabhaihashim3405]

Amazing

[@mohdzeeshan6762]

Top madam 👌

[@mendrevaishnavi4598]

Thank you very much maam!!!!

[@-Engineering01-]

Hi, what if i have 4T(n-1) -3T(n-2) +1 ?

[@funtush211]

love from Pakistan

[@ayushbaranwal9705]

That's helpful ma'am

[@rockingbeast3651]

what to do when the question asks for the time complexity of merge sort or something like that. How to solve that

[@deepakrj0596]

Hii...
New subscriber.

[@shoaibsheikh863]

Very useful

[@Sachinkumar-ou5vu]

Nice Thank you

[@bitlegion1027]

well explained

[@varshakakade-io2qb]

Can I refer to your video for ME of subject algorithm and complexity

[@StartPracticing]

Yes of course

[@malikmuneebshahid2401]

Thanks slot😚

[@preezyff9098]

Thank you mam

[@AnkitSharma-pe7ui]

Thanks

[@raviprakashpatel6351]

Can u explain forward substitution method same example

[@sudhakardevar2301]

tq

[@gaurawk.]

Yeh backward substitution hai kya

[@sheetal_s5153]

Please solve 2t((n/2)+16)+n by substitution method it's urgent🙏🏻

[@siddhantpathak2063]

That helped

[@Masakkalii]

But n/2 kyo kiya kuch to logic batao kya reson hay

[@samiulislamdurjoy]

G 132

[@sumainakyasar8857]

Ma'am, how did u get n/2^i =1?

[@ghulamdastgeersubhani]

By using base condition which is given in question

[@darshanavar]

the solution for solving the first question by masters method is theta(nlogn) ,but you are getting O(nlogn) which one is correct?

[@junaid300]

At 17:04 Ye equation kaha sy derived ki?.🤔

[@StartPracticing]

Sum of n terms ka formula hai

[@WRLD-yj3yw]

heart
'

[@arnabpratihar7916]

Ma'am solution ko verify nehi Kiya using Mathematical Induction😢

[@imsachinkumarr]

It's Iterative method not substitution

[@vandanthakar7076]

Dumb its correct

[@souradeepmaity6148]

​@@vandanthakar7076😂😂

[@sanataniengineer4074]

You fool both are same method😂😂

[@khushpreetsingh1352]

mam formula ki use kardao ho

[@basitali8463]

not understand clearly
algorithm is too difficult for us watch this vedio 3 time but still not clear sorry
😰😰😰😰

[@cybershrajal]

aa gaya fir se

[@inspireVoyage123]

n/2*n/2 = nsquare/4, why the hell there is n only

[@adityarajsingh329]

reeeeeeeeeeeeeeeecurence

[@Ayesha-pu2pq]

lmao aren't you from amity university rajasthan

[@fellowcrazefeelings8360]

Easy example solve kr dete hai bss complex example solve hi ni krte

[@Prashanthkumarpodamala]

Nice explaination

[@SOHAILKHAN-iu8fu]

Thank you mam