Merge Sort - Explained in 4 minutes

Full course On Algorithms & Data Strucutres :

Merge sort is an sorting algorithm based on recursion (devide and conquer),
In this video you will learn merge sort in just about 4 minutes
Merge sort is Explained using animations.

Merge sort devides input array into two smaller arrays.
and recursively continue, until there is only one number in each array.

Then we start to merge these parts together.
We use merge function for this part, (the merge function is described in the end of this video)
And we return this as an result.

Merge sort is optimal sorting algorithm, that means there is no way to create sorting algorithm (that works) with better time complexity.

Time complexity of Merge Sort is big O of n * log n.
Same as Heap Sort or average case of Quick Sort.

Tags: sort array using merge sort, how to merge sort, how to sort an array using merge sort, merge sort example step by step, merge sort with example, merge sort analysis