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

Start learning Write review
University of the People Ad

Earn Your CS Degree, Tuition-Free, 100% Online!

Learn More → Noble Desktop Ad

Live Online Classes in Design, Coding & AI — Small Classes, Free Retakes

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This course explains merge sort and its recursive implementation, then analyzes its time and space complexity, including with the Akra–Bazzi formula. It also covers an in-place approach and its code.

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

Start learning

Never Stop Learning.

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

Sign up for free
Someone learning on their laptop while sitting on the floor.