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


Merge Sort Algorithm Using Java - Sorting Algorithm in Data Structures

Great Learning via YouTube


Merge Sort Algorithm, invented by John von Neumann in 1945, is one of the most efficient sorting algorithms and is based on the Divide-and-Conquer concept. Merge Sort Algorithm repeatedly divides a list into two equal halves until it can no longer be split in two. A Merge sort algorithm divides a list into various sub-lists, each of which consists of a single element, and combining of the sub-lists results in a sorted list.

Great Learning brings you this video “Merge Sort Algorithm”, aimed at helping you understand this specific type of algorithm. This video will help you understand the implementation of Merge sort algorithms and its analysis. The video will also take you through Merge sort Time/Space Complexity and also explain the difference between Quick sort and Merge sort algorithms. Added to this, the video teaches these concepts by carrying out simultaneous demonstrations as well as examples on Merge sort algorithms.


What is Merge Sort?.
Merge Sort - Algorithm.
Merge Sort - Demonstration.
Merge - Algorithm.
Merge - Demonstration.
Merge Sort - Implementation.
Merge Sort - Analysis.
Merge Sort - Time Complexity.
Merge Sort - Space Complexity.
Quick Sort vs. Merge Sort.
Merge Sort Examples.
Thank you!.

Taught by

Great Learning


Start your review of Merge Sort Algorithm Using Java - Sorting Algorithm in Data Structures

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.