Problem
A well-known algorithm called bubble sort proceeds by scanning the list from left to right, and whenever a pair of adjacent keys is found to be out of order, bubble sort then those entries are swapped. In this first pass, the largest key in the list will have "bubbled" to the end, but the earlier keys may still be out of order. Thus the pass scanning for pairs out of order is put in a loop that first makes the scanning pass go all the way to count, and at each iteration stops it one position sooner. (a) Write a C++ function for bubble sort. (b) Find the performance of bubble sort on various kinds of lists, and compare the results with those for insertion sort.