Chapter 14, Problem 13RE

Explanation of Solution

a)

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.

Walkthrough of the merge sort:

The given set of elements are “5 11 7 3 5 4 7 11 4 9”

The list is split to obtain a sorted sub list as shown below:

Split 1: Split the elements into two equal halves.

5 11 7 3 5    4 7 11 4 9

Split 2: split the sub-list into equal halves

5 11    7 3 5    4 7    11 4 9

Split .3: split the individual sub-list.

5    11    7    3 5    4    7    11    4 9

Split 4: now the entire list is split and the merge is made with the two halve in the sorted order...

Explanation of Solution

b)

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.

Walkthrough of the merge sort:

The given set of elements are “9 0 11 10 5 8 -7 6 8 7 5”

The list is split to obtain a sorted sub list as shown below:

Split 1: Split the elements into two equal halves.

9 0 11 10 5    8 -7 6 8 7 5

Split 2: split the sub-list into equal halves

9 0    11 10 5    8 -7 6        8 7 5

Split .3: split the individual sub-list.

9    0    11    10 5    8    -7 6    8    7 5

Split 4: now the entire list is split and the merge is made with the two halve in the sorted order...