L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | Algorithm

#substitutionMethod#solveRecurrenceRelation#algorithm

►Design and Analysis of algorithms (DAA) (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

[ShivamThakur-rtjs]

Solution of given recurrence relation is n!. But its time complexity is O(n^n). See in worst case we take upper bound (i.e highest possible value for given function ). So we have to find upper bound For n! . If we expand it, it will give us n number of values n times (i.e n(n-1)(n-2).... or factorial of 5 will gives us 5 values 5*4*3*2*1). We also know that while finding O(c) we take it as O(1). So, to summarize O(n!) => O(n*(n-1) * (n-2)....1) => O(n*n*n...n) => O(n^n)

[sakshambairathi]

I have been searching this topic from a while and believe me no one on youtube could explain it as good as you did thankyou and keep making more videos

[anubala]

Thanqq sir... Aapse Acha or koi nhi pda skta...aap free me itne ache lecture provide krwa rhe ho hme.. thanqq soo much

[salilshukla]

No one can teach more clearly than you sir.

[coder_boy]

Sir at last the value of can be O(n!)
Can't we write this as our answer???

[aayushivijaygadekar]

I am an MCA student and your videos helps me to understand the topic thoroughly, Keep growing!
😇

[akashverma]

this is the iterative method to solve the recurrence relation

[neeharikataneja]

Thanks a lot sir... Love your tutorials. May god bless you :) Thanks for being so good :)

[teeshasingh]

Teachers in College🤡 Teachers in Youtube(especially this sir👆)👑🙌🔥


Not insulting my college teachers, but just speaking up the fact..
Sir, you are teaching just phenomenal, I lost hope of learning DAA, but watching you, made me again interested in the Subject🔥🙌
Keep on making more such videos...❤

[ramshamanzoor]

much appreciated teaching method THANKYOU ....

[sheikhsuhailkhursheed]

Sir, shouldn't it be O(n!).

Can you please explain how we can say that O(n^n) is the answer?
Is there any role of asymptotic notations here?

[kpopstan]

it's good to watch these videos before exam rather than attending those boring college lectures.

[KING-nize]

Sir you are just like Physics Wallah Sir. Thank you for your valuable classes.

[younus.athlete]

Sir !! Your Level of Teaching is very closer to our thought.. I really like your way of Teaching ...

[garimanarang]

u r simply superb... i too taught Daa ... but watching ur videos make my day

[chiragchavda]

Sir, can't we say time complexity of N factorial?! In this case!?

[harini.a]

Thank u sir for this wonderful video
...

[Ramu_Sriram]

Thank you bhai. This topic was confusing during the semester when I was studying DAA. But after practicing recursion questions in DSA and watching this video, it finally made sense for me.

[AmitKumar-ixkq]

Sir aap kitne pyaar se padhate ho. Thank You

[bilalasim]

sir aap bohat acha parhate hain please pakistan me ajayn karachi wali fast university me akr sary subjects parha den