Part 9 of 15 in Sorting  

Merge sort algorithm

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).