Allan Didier

APCS Final Exam Review

Program #1 Details

Sort a 2D array of objects.

For example: In car races like the Indianapolis 500, race designers need to determine a starting race order of the cars. The race begins with cars in multiple lanes and multiple cars in each lane. The qualifying times of the drivers are used to determine the car’s location at the start of the race. Write a program which will create a 2D array of 12 cars (3 lanes, 4 cars per lane) and sort them based on their driver’s qualifying time. Output the unsorted 2D array of driver names and qualifying times and the sorted 2D array with the fastest qualifying time at the array location [0,0] and the slowest time at the end. Driver names and times can be hard-coded or random.