Chapter 14.5, Problem 16SC

Explanation of Solution

Sorting:

Sorting is a process where the elements of a list are arranged in a particular order. The order of the list can be either present in the ascending order or descending order.

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.

Merge sort is considered to be an $\text{O(n}\text{log(n))}$ algorithm.

Time taken to sort an array:

The time taken to sort an array with 100,000 values will be

$\begin{array}{l}=\frac{\text{1000000}\times \text{log}(}{}\end{array}$