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.

[@SrinivasSK1988]

Nice explanation

[@kwickslow19]

nicely explained, thank you so much.

[@witchess2576]

Great explanation .Thank you soo much for the video!

[@leviloseke7135]

great video

[@lolnibob4332]

Super helpful!

[@vinaychauhan6587]

Thanks for the easy explanation

[@avocadorable_s5637]

Thanks so much!!

[@trunghieule7503]

easy to understand ! thank you

[@shariadhossain9508]

Thanks a lot♥️♥️♥️

[@SANTANUKUMAR.-tz6pb]

thanks mam

[@sridharmass4276]

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

[@swaraj.nalawade.4634]

it is (log n)^p

[@lastfirst5351]

"its easy to say that k=3"

[@akashshrivastava8723]

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

[@artwork3981]

Anyone from Buk Kano

[@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