Master Method for Solving Recurrences (Dividing Function Example video)

[@juniedkhan8370]

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

[@sinjini3189]

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

[@GilbertKibet-fl2vu]

thanks so much well understood

[@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.c8259]

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

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

[@yasinsamad7763]

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

[@Chillguy_me]

Anyone from Buk Kano

[@witchess2576]

Great explanation .Thank you soo much for the video!

[@kwickslow19]

nicely explained, thank you so much.

[@Har1i11]

Best explanation!

[@sridharmass4276]

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

[@swaraj.nalawade.4634]

it is (log n)^p

[@vinaychauhan6587]

Thanks for the easy explanation

[@lolnibob4332]

Super helpful!

[@mercysithole3049]

Thank you❤

[@trunghieule7503]

easy to understand ! thank you

[@SrinivasSK1988]

Nice explanation

[@leviloseke7135]

great video

[@avocadorable_s5637]

Thanks so much!!

[@shariadhossain9508]

Thanks a lot♥️♥️♥️

[@akashshrivastava8723]

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

[@knightmiki7062]

najjaca si mi ribo

[@nitusah1985]

you can not solve your 2 nd Problem using master Theorem

[@SANTANUKUMAR.-tz6pb]

thanks mam

[@avijitmajumder6919]

Last solution is wrong : n^2 * logn

[@ParthShethia]

yours is wrong bro

[@taiyabakhan4923]

@@ParthShethia can you explain pleaseee

[@lastfirst5351]

"its easy to say that k=3"

[@sayedmahdi8396]

i love indians