Chapter 17.1, Problem 17.1CP

Explanation of Solution

Bubble sort:

This is simple sorting algorithm to sort the elements in ascending order or descending order.

• This algorithm makes the several passes through the elements of the array and the smallest elements are “bubble up” to the top of the array.
• On each pass, the larger elements are “bubbled” towards the end of the array.
• After all the passes are completed, the elements are arranged from smallest to biggest in order.

Example:

Consider the list of elements (4, 8, 2, 6) to perform the bubble sort.

Pass 1:

• Compare the elements in the first pair (4 and 8); no swap is needed because the pair is already in order.
• Now compare the elements in the second pair (8 and 2); the value 8 is higher than the value 2. So, swap the values 8 and 2.
• Compare the elements in the third pair (8 and 6); the value 8 is higher than the value 6. So, swap the values 8 and 6.