Recursion tree method: intuition | Merge Sort | Data Structure & Algorithm | Appliedroots

Chapter Name: Merge Sort
Please visit: gate.appliedroots.com/
For any queries you can either drop a mail to [e-mail] or call us at [phone]

[@subhamoyburman3093]

Thank you Sir, after almost 2 months of reading it for the first time, I found the explanation now which made me understand it perfectly

[@treycashon346]

I'm in college right now, thank you for making this video. It's waaay more useful than my professor's awful lectures.

[@osmankhalid2005]

it is perfect explanation as it is not skipping all those minor details that most of the videos are skipping because presenters themselves are not clear, so they are making video for the sake of making something.

[@cubangeorge]

Amazing teacher ! thank you sooooo much for this superb quality of teaching

[@manuelconte623]

HO CAPITO FINALMENTE !!! SEI UN GRANDE! from italy.

[@ayushlohia2992]

Very well explained....perfect explanation 🔥🔥

[@knowledgehunter4045]

i do really like your intuitive explanation thanks sir

[@louerleseigneur4532]

Good one sir

[@asmabader5758]

Thank you so much!

[@emirrcaglar]

thank you so much

[@rosonerri-faithful]

Very nice explanation Sir 🙏. Want more explanatory videos of yours sir

[@GATEAppliedCourse]

Sure 👍

[@ansh4802]

Amazing just amazzziiiiiiinggggggg

[@azuboof]

beautiful teaching sir.

[@chinmaygopal9295]

Brilliant

[@Ndegwiz]

Thanks

[@valliyappans9949]

Why r we concerning about constant here ,n is better that n.logn ?

[@yashpriyadeepkatta8823]

What constant?

[@ahmetkarakartal9563]

thank you so much