Master Method for Solving Recurrences (Dividing Function Example video)

Solve two questions using the master method formula for dividing function. In this video, you will learn how to solve recurrence relation using the Master Method formula.

[juniedkhan]

best best best!!!
tomorrow is my exam now i am seeing it help me a lot
thank u

[sinjini]

You explained it much better than my professor!! Thank you so much!!

[debarghya_g]

Thank you ma'am for this wonderful explanation. This is by far the best video on solving recurrence relations using Masters Theorem.

[naurimeriyak.c]

Wonderful and well-comprehensible explanation. Thank you so much.

[Crazy_boy_dilip]

Very very best explanation thank you akka

[witchess]

Great explanation .Thank you soo much for the video!

[yasinsamad]

does that mean '' log p(n) ' , where p is base!

[the_kidsey]

What if log b a=k, and p=0?
Under 1st condition, in case 2 when we try to find log (p+1) it'll show 0

[sridharmass]

Ain't logn 0 is undefined? How p was 0 if logn p=1?

[akashshrivastava]

T(n)=3T(n/2)+n(b) solve this queation..

[nitusah]

you can not solve your 2 nd Problem using master Theorem