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.

[@debarghya_g]

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

[@sayedmahdi8396]

i love indians

[@naurimeriyak.c8259]

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

[@kwickslow19]

nicely explained, thank you so much.

[@witchess2576]

Great explanation .Thank you soo much for the video!

[@lolnibob4332]

Super helpful!

[@avocadorable_s5637]

Thanks so much!!

[@vinaychauhan6587]

Thanks for the easy explanation

[@sridharmass4276]

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

[@swaraj.nalawade.4634]

it is (log n)^p

[@SrinivasSK1988]

Nice explanation

[@trunghieule7503]

easy to understand ! thank you

[@leviloseke7135]

great video

[@artwork3981]

Anyone from Buk Kano

[@shariadhossain9508]

Thanks a lot♥️♥️♥️

[@SANTANUKUMAR.-tz6pb]

thanks mam

[@lastfirst5351]

"its easy to say that k=3"

[@akashshrivastava8723]

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

[@avijitmajumder6919]

Last solution is wrong : n^2 * logn

[@ParthShethia]

yours is wrong bro

[@nitusah1985]

you can not solve your 2 nd Problem using master Theorem