DAA Session 5B: Recursion tree method Examples | T(n) = 2T(n/2) + C | T(n)=T(n/3)+T(2n/3)+n

In this video you will find good examples on Time complexity using Recursion Tree method explained in a detailed and easy way.

eg1. What is the complexity of T(n) = 2T(n/2) + C
eg2. T(n)=T(n/3) + T(2n/3) + n

Please share your valuable comments.


I'm Ranjana Yadav. I have done my graduation in Computer Science from NIT Kurukshetra and currently working as a Senior Software Engineer at a MNC.
I love to teach Computer Science topics. It really makes me happy when my content helps you guys in your exams, placements etc.


Please find below my mother's channel too..
If you like cooking then please subscribe it, you will find useful recipes here or you can subscribe just to support her..
@renuyadav8795


Thanks


#Algorithms #DataStructure #TimeComplexity

• #education
• #time_complexity
• #recursion_tree_method
• #recursion_tree_method_for_solving_recurrences
• #how_to_find_time_complexity_examples
• #what_is_the_complexity_of_tn_2tn2_c
• #tntn3t2n3n
• #quality_education_is_best_education
• #recursive_functions
• #recurrence_relation
• #easy_explanation_in_hindi
• #algorithms
• #data_structures
• #time_complexity_using_recursion_tree_method