Merge Sort Algorithm | Sorting Algorithms| Merge Sort in Data structure

Discussed merge sort algorithm with an example. Step by step instructions on how merging is to be done with the code of merge function.

Definition:
Merge sort is a sorting technique based on divide and conquer technique. With worst-case time complexity being Ο(n log n), it is one of the most respected algorithms.
Algorithm:
Step 1 − if it is only one element in the list it is already sorted, return.
Step 2 − divide the list recursively into two halves until it can no more be divided.
Step 3 − merge the smaller lists into new list in sorted order.