Merge Sort

Merge Sort :

This is one of the sorting algorithm which follow divide and conquer property. The time complexity of this algorithm is NLogN. Also it requires a temporary array, hence space complexity is N, where N is the number of elements to be sorted.