Merge Sort Explanation

  Merge sort is a divide and conquer algorithm. It is an O(n log n) comparison-based sorting algorithm. Most implementations produce a stable sort, meaning that the implementation preserves the input order of equal elements in the sorted output.

Conceptually, a merge sort works as follows

1. If the list is of length 0 or 1, then it is already sorted. Otherwise:
2. Divide the unsorted list into two sublists of about half the size.
3. Sort each sublist recursively by re-applying the merge sort.
4. Merge the two sublists back into one sorted list.

 A step by step procedure, Approach, Theoretical Evaluation , Results and Analysis of MERGE SORT algorithm is give in this short pdf file Click Here To Download This File Now

Here Is the Code Of the Merge Sort Implementation

 Click HereTo go to that code

if you need any further information or help regarding Merge Sort Algorithm Then Plzz let me Know by Commenting below, I'll Feel great to help u