2.5 Recurrence Relation | Substitution Method | Example-1 | Algorithm Design

In this video, I have discussed how to solve a recurrence relation using the substitution method for solving algorithm complexity with the help of an example.
Previous video link: • Asymptotic Notations |...
I have created this free of cost TH-cam channel for computer science and information technology students. Through this channel, I have tried to explain some important topics in a simple way. This channel is very helpful for computer science engineering students may be from GATE, NET, M.TECH, B.Tech, BCA, BSC, MCA, MSC etc. In this channel, I am trying to cover previous years solved GATE questions, Data Structures, Algorithm Design, Operating System, Data Base Management System(DBMS), Theory of computation (TOC), compiler design, C programming etc.
Below are the links of my playlists:
1. Operating System: • Operating System by Na...
2. Data Structures: • Data Structures by Nar...
3. Motivational Videos: • Motivational Videos by...
4.. Algorithm: • Algorithm Design by Na...
5. Theory of Computation: • Theory of Computation ...
6. Compiler Design: • Compiler Design by Nar...
7. GATE previous year solutions: • GATE Previous Year Com...
My Channel URL:
/ nargishgupta
My Website URL:
www.nargishgup...
#substitutionmethod
#recurrencerelation
#algorithmanalysis
#algorithm

[@YashGupta-bz8ry]

m studying from this channel for my gate prep. sir deserve more views, i really hope he is full-time teacher and takes offline classes

[@darshangaikwad8626]

Sir sahi padaya 🙌🙌

[@arshitaanchaliya1583]

Sorry but I don't get how u write the UpTo values that T(n-(n-1)).......

[@bhikajipawar9227]

Nicely explained

[@mustafamarri7436]

so easy thanks

[@fardinahosanshawon9727]

Thanks sir,love from Bangladesh

[@priyabrigenza1292]

Your teaching method is awesome

[@nancysaxena3670]

Your video is really helpful sir.. Thank u.. 😀

[@kamranansari4887]

best explanation ever get

[@mod_cyber1015]

Nice veideo that I ever get regarding to this subject.

[@ngtutorials]

Thank you..

[@abhijeetsingh4110]

Thanks sir for this video

[@rajsinha1050]

No words sir...😮❤❤ Thanks a lot
You just nailed it in very easy way 🙏

[@raginimaurya1085]

Good explanation👍👍

[@sumainakyasar8857]

Sir, I can't understand what happened after 7.00. You explained something.. But as I don't know Hindi, I can't get it

[@ngtutorials]

Ki that I was generating a n term series nothing else

[@sumainakyasar8857]

@@ngtutorialssir, how do we get T(n-(n-1))+n-(n-2)+n-(n-3)+......?

[@DusmantaPradhan-m4z]

Thank you sir for clear explain🙏🙏

[@lavishrana886]

nice job

[@shubhamchoubey3948]

Nice..but air at the last..the equation is wrong..i think.. (N(n+1))/2 will not generate that series🤔 it will be only n+1 and complexity O(n)

[@ngtutorials]

Dear shubham this is the formula of sum of n numbers which is n(n+1)/2..

[@rosonerri-faithful]

Sir, pls solve this problem.. I m not able to solve this. T(n)=T(n+5)+n?

[@rrdheerendratiwari]

O(n)

[@SahilKhan-zn9px]

Nice

[@HemantKumar-eo4wn]

Nice sir

[@priyankakunwar8685]

Thnku sir

[@RAKESHSINGH-mt6uk]

kis university k teacher h sir aap

[@ngtutorials]

RGPV