The Durban July is an annual horse race that has been presented every year since 1897. Write a C/C++ program to handle registrations for the race. The program must meet the following specifications: Create a structure (struct) to save the following information for each horse in the race: o Name - up to 20 characters; o Age - Age in years (integer); o Height - The height of the horse in hands (integer); and o Time that the horse achieved in the last race in seconds (real value). Create an array of structures (structs) that are used to save the information for four horses. The user types in the information for each horse. After the horse's information is stored in the array, the schedule for the race must be displayed based on the contents of the array. Iterate through the array and display the information on one line for each horse. The horse with the best time for the previous race is named as the favorite. Iterate through the array, identify the horse with the best time and show it at the bottom of the schedule. Assumethat each horse's time will be unique.
The Durban July is an annual horse race that has been presented every year since 1897. Write a C/C++ program to handle registrations for the race. The program must meet the following specifications: Create a structure (struct) to save the following information for each horse in the race: o Name - up to 20 characters; o Age - Age in years (integer); o Height - The height of the horse in hands (integer); and o Time that the horse achieved in the last race in seconds (real value). Create an array of structures (structs) that are used to save the information for four horses. The user types in the information for each horse. After the horse's information is stored in the array, the schedule for the race must be displayed based on the contents of the array. Iterate through the array and display the information on one line for each horse. The horse with the best time for the previous race is named as the favorite. Iterate through the array, identify the horse with the best time and show it at the bottom of the schedule. Assumethat each horse's time will be unique.8
Step by step
Solved in 3 steps with 1 images
