Question $11$

$2$ pts

Binary search is an efficient $O(logN)$ algorithm when applied to data structures that are $...$

Linear data structures with $O(1)$ random access operators, and elements are stored in order.

List data structures with elements stored in order.

Vector data structures with elements stored in arbitrary order.

Any type of linear data struture.