While it is true that the time it takes to draw the shape is about n^2 of the number of shapes draw, n^2 is not an unreasonable time. This means that the algorithm does run in a reasonable amount of time and B is the right answer.
This was a silly mistake, I thought I clicked B.
In order compare the student scores to the maximum score, this code section traverses the list starting with the second member. The final member in the list won't be checked by the code segment, though. The loop will end without comparing the final student score in the list to the highest score possible when index equals the length of the list.
Topics to study:
Unit 5: Investigate computing innovations (DNS, packets, internet)
Individual
Collegeboard MCQ Test #4
Questions I got wrong:
In order compare the student scores to the maximum score, this code section traverses the list starting with the second member. The final member in the list won't be checked by the code segment, though. The loop will end without comparing the final student score in the list to the highest score possible when index equals the length of the list.
Topics to study:
Parallel Computing Hashmap