See complete series on sorting algorithms here:
In this lesson, we have explained merge sort algorithm. Merge sort is a divide and conquer algorithm that has worst case time complexity of O(nlogn).
See source code of real implementation here -
For more such videos and updates, subscribe to our channel.
You may also like us on facebook: