Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Merge Sort Using Recursion - Theory, Complexity, Code

Kunal Kushwaha via YouTube

Overview

Dive into a comprehensive 50-minute video lecture on the merge sort algorithm, exploring its theory, recursive implementation, complexity analysis, and in-place sorting approach. Learn the step-by-step process of merge sort, understand its time and space complexity, and gain insights into solving complexity using the Akra-Bazzi formula. Follow along with code examples, including an in-place implementation, to solidify your understanding of this efficient sorting technique. Enhance your data structures and algorithms knowledge for technical interviews and placements while participating in the #DSAwithKunal learning initiative.

Syllabus

Introduction
Merge Sort
Steps for Merge Sort
E1 : Recursive Merge Sort
Explanation of E1
Time Complexity
Space Complexity
Solving Complexity using Akra-Bazzi Formula
In-place Merge Sort
Code for in-place Approach
Outro

Taught by

Kunal Kushwaha

Reviews

Start your review of Merge Sort Using Recursion - Theory, Complexity, Code

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.