Substitution Method

[@indiajackson5959]

This video needs 1 million likes! I have been trying to figure out the purpose of the base case for daysssssss! Thank you! Do you have a video on the 2T(n/2+17)…that one is killing me

[@callummcanerney9721]

2:15 in your hypothesis what are k and n and why do you specify for all k < n? Is this the same as for all n > n_0? Also how did you chose k = n/2?

[@dennislarsen5744]

Just wanna say thanks for your videos. Truly amazing and simplified.

[@ankitaSharma-lz7xx]

when we are finding log 2 and log 3 value why are we taking base 2 not base 10 for both

[@JoseJr2901]

what made you guess that T(n)= O (n log n)?? is there any tip of how I always make the right guess? I just cannot understand how am I supposed to guess that value

[@DrMHJamal]

There is no standard way to make the guess that is always right. You have to do hit and trial. You can make an educated guess by using a result of a similar equation you have seen before. Recursion tree method also gives you a good guess.

[@leeris19]

The best proof

[@AyushKumar-wx6tn]

Is this really the substitution method as we have been taught a different method as substitution method for finding the time complexity of recurrence relations?

[@DrMHJamal]

That method is the iterative method which some call the Substitution Method.

[@AyushKumar-wx6tn]

@@DrMHJamal okay thanks, I got so confused

[@vissivclolc]

so if the problem is T(n) = 2T(n/2) + O(n)
and we guessed T(n) = O(n),
we follow inductive step to find T(n)

[@Etm-02]

Sir plz upload more courses

[@aounhaider228]

😂😂😂