What is Merge Sort?

 
Merge sort is one of the most efficient sorting algorithms. It works on the principle of "Divide and Conquer". Merge sort repeatedly breaks down a list into several sublists until each sublist consists of a single element and merging those sublists in a manner that results into a sorted list.
 
In this video, you will learn how the Merge sort works, how to implement it, and how to program with it. You will also learn what is Divide and Conquer rule. Last up, you will learn the time complexity and space complexity of Merge sort.
 

Merge Sort Algorithm
Jul 08 2019

Patrica Millie

In this video, the Merge sort explained in plain English. You will learn how the Merge sort works, how to implement it, and how to program with it.

Recommended Videos

No Result