Page 1261 - AP Computer Science A, 7th edition

36. (A) Since the records are not sorted, the quickest way to find a given name is to start at the beginning of the list and sequentially search for that name. Choices C, D, and E will all work, but it’s inefficient to sort and then search because all sorting algorithms take longer than simply inspecting each element. Choice B won’t work: A binary search can only be used for a sorted list.