Describe the word Merge Sort

Question

Describe in brief the word Merge Sort?

Answer 1

The merge sort is as well divide and conquer sort. This works by considering the data to be sorted as a series of already-sorted lists (in worst case, each list is one element long). Adjacent sorted lists are merged to bigger sorted lists till there is a single sorted list having all the elements. The merge sort is good at sorting lists and the other data structures which are not in arrays and it can be employed to sort things which do not fit to memory. It as well can be implemented as a stable sort.