Merge Sort Using Recursion (Theory + Complexity + Code)

In this video, we cover the merge sort algorithm. Including the theory, code implementation using recursion, space and time complexity analysis, along with the in-place sorting approach. Take part in the learning in public initiative! Share your learnings on LinkedIn and Twitter with #DSAwithKunal & don't forget to tag us! 👉 Resources - Join Replit: http://join.replit.com/kunal-kushwaha - Complete Java DSA playlist: https://www.youtube.com/playlist?list=PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ - Code, Assignments, & Notes: https://github.com/kunal-kushwaha/DSA-Bootcamp-Java ➡️ Connect with me: http://kunalkushwaha.com ========================================= Timestamps: 00:00 Introduction 00:31 Merge Sort 03:16 Steps for Merge Sort 06:58 E1 : Recursive Merge Sort 22:18 Explanation of E1 25:31 Time Complexity 29:01 Space Complexity 29:37 Solving Complexity using Akra-Bazzi Formula 33:06 In-place Merge Sort 44:14 Code for in-place Approach 49:34 Outro #sorting #placement #dsa #interviews