Working process of Merge Sort

Question

Write down in brief the working process of Merge Sort?

Answer 1

The Merge Sort algorithm is as described below:

a) The length of list is 0 or 1 and then it is considered as sorted.

b) Or else, divide the unsorted list into two lists each regarding half the size.

c) Sort each sub list recursively. Implement the step (b) till the two sub lists are sorted.

d) As a final step, combine (or merge) both the lists back to one sorted list.