Visit www.myprogramminglab.com to complete select exercises online and get instant feedbac...

Visit www.myprogramminglab.com to complete select exercises online and get instant feedback.

Exercise

Design a class called BubbleSort that is similar to the class SelectionSort given in Display. The class BubbleSort will be used in the same way as the class SelectionSort, but it will use the bubble sort algorithm.

The bubble sort algorithm checks all adjacent pairs of elements in the array from the beginning to the end and interchanges any two elements that are out of order.

This process is repeated until the array is sorted. The algorithm is as follows:

Bubble Sort Algorithm to Sort an Array a

Repeat the following until the array a is sorted:

for (index = 0; indexa[index + 1])Interchange the values of a[index] and a[index + 1].

The bubble sort algorithm is good for sorting an array that is “almost sorted.” It is not competitive with other sorting methods for most other situations.

Display

Selection Sort Class