What do you mean by Merge sort?
The merge sort is a divide and conquer sort as well. It works by considering the data to be sorted as a sequence of already-sorted lists (in the worst case, each list is one element long). Adjacent sorted lists are merged into larger sorted lists until there is a single sorted list containing all the elements.
The merge sort is good at sorting lists and other data structures that are not in arrays, and it can be used to sort things that don’t fit into memory.
It also can be implemented as a stable sort.