Chapter 14, Problem 16RE

Explanation of Solution

Merge sort:

A sort where the first two halves of the data structure are sorted and then the sorted sub-arrays array is merged together to form a sorted list is called as merge sort.

Efficiency of the algorithm:

• In the step when the merging is made, the item that is present from the both sub-list has to be compared when the elements are removed from the list in order to create a sorted array.
• Consider if the item removed is similar to the last item added then it is a duplicate element and it needs to be thrown away...