Recursion tree method - Example 1

[neil19187]

superb explanation of the method... just awesome. Thanks for this :)

[mailtoshrikantbang]

Thank You for excellent explanation.

I think complexity of T(n) = 3T(n/3)+cn should be O( n log ( base to 3 ) n ) .

[shenth27]

Excellent. Thanks soooo much.

[sandy31619]

AwesomE... Helped a lott.. and You have looootttt of patience to explain it so neatly..

THANKS :D :D

[ccadpc07]

Awesome! Nobody can do it in a better way

[MUKHIYA507961]

good lectures. How did you make this video? i MEAN which software do you use? please let me know.

[TheOresoft]

@MUKHIYA507961 Two ways

Hardware: A Wacom Bambo tablet costs around $50

Software to scribble: Smoothdraw

Software to record: Camstudio

[TubeAreej]

Thank you, it helped

[nitin4ahuja]

explained better than our college lecturers

[reihaze7]

this vid really helped me out