C++ Design a class called bowler that stores data about a participant in a bowling tournament. For each bowler, the following information should be tracked: first name, last name, three bowling scores, and an average score. Valid bowling scores are in the range of 0-300. Include appropriate constructors, mutators, and accessors. Overload the ==, <, and > operators to compare the average score of one bowler's record to another. Once you have designed your class, implement an array that can store up to 25 bowler records. An index should be included to keep track of how many bowler records have been entered. Include an insertionSort routine to sort the bowler records. (Hint: If you overload the ==, <, and > operators, a standard insertionSort will work. However, you will need to revise the algorithm to sort from highest to lowest.) Implement a menu system that implements options to add a bowler to the list and print a complete list of bowlers in the array sorted by bowling average (highest to lowest).
C++
Design a class called bowler that stores data about a participant in a bowling tournament. For each bowler,
the following information should be tracked: first name, last name, three bowling scores, and an average score.
Valid bowling scores are in the range of 0-300. Include appropriate constructors, mutators, and accessors.
Overload the ==, <, and > operators to compare the average score of one bowler's record to another.
Once you have designed your class, implement an array that can store up to 25 bowler records. An index
should be included to keep track of how many bowler records have been entered.
Include an insertionSort routine to sort the bowler records. (Hint: If you overload the ==, <, and >
operators, a standard insertionSort will work. However, you will need to revise the
highest to lowest.)
Implement a menu system that implements options to add a bowler to the list and print a complete list of
bowlers in the array sorted by bowling average (highest to lowest).
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
