Choosing the collection by the operation

• A

  Sort the list and binary search it

• B

  A hash set; membership becomes roughly constant time instead of a scan

• C

  Keep the list but cache recent lookups

• D

  Use a linked list instead, since it is faster for large collections