Illustrates the term Merge Sort

Question

Illustrates the term Merge Sort?

Answer 1

The merge sort is a divide and conquer sort also. This works by considering the data to be sorted like a sequence of already-sorted lists (within the worst case, all lists are one element long). Adjacent sorted lists are merged in larger sorted lists till there is a single sorted list having all the components. The merge sort is good at sorting lists and other data structures which are not in arrays, and this can be used to sort things that don't fit in memory. This also can be implemented as a stable sort.