Three example C++ programs

Solution Preview

This solution addresses the first three questions in the posting. Each question has an associated cpp file.

The first question deals with sorting an array of names. The sort algorithm used is the bubble sort. The bubble sort is a simple but inefficient sorting algorithm. Due to its simplicity it is easy to implement. However, for longer data sets its inefficiency makes it unsuitable for use.

The basic bubble sort algorithm is to go through the list, from front to back, and compare adjacent elements. If the elements are out of order, swap them. After making one pass through the list then the largest element is guaranteed to be at the end of the list. It
"bubbled" to the end. Since each full pass of the list guarantees the one more element will be in the correct location, we need to do "n" passes. The ...