Which of the following algorithms would be efficiently executed on an ArrayList?
A) add 1 element to the middle of a list with n elements
B) add n / 2 elements to a list with n / 2 elements
C) remove first n / 2 elements from a list of n elements
D) read n / 2 elements in random order from a list of n elements

Question

Quizplus · Accepted Answer

Reading elements in random order from an ArrayList is efficient because it provides O(1) time complexity for accessing elements by index.

Which of the Following Algorithms Would Be Efficiently Executed on an ArrayList