Merge Sort

Merge sort is an efficient sorting algorithm that uses recursion for sorting input data set. This sorting algorithm uses divide and conquer technique. This algorithm was introduced by John Von Neumann in 1945.

This algorithm is much suitable for larger data set. It uses extra auxiliary memory for sorting, as recursive call are to be placed to complete the entire process.


Login to TRACK of Comments.