Page 703 - AP Computer Science A, 7th edition

33. (E) All of these data structures are reasonable. They all represent 20 bingo numbers in a convenient way and provide easy mechanisms for crossing off numbers and recognizing a winning card. Notice that data structure II provides a very quick way of searching for a number on the card. For example, if 48 is called, bingoCard[48] is inspected. If it is true, then it was one of the 20 original numbers on the card and gets crossed out. If false, 48 was not on that player’s card. Data structures I and II require a linear search to find any given number that is called. (Note: There is no assumption that the array is sorted, which would allow a more efficient binary search.)