Hey Jeanne, Scott, Staff team,
Answer 19 should be A. and B.
binarySearch() will always yield the middle element index if it is a match regardless of whether the array is sorted or not.
I understand the intent is to explain the unpredictability of binarySearch() in case the array is unsorted.
I would suggest changing: B. to B. 0 and F. to F. one output is unpredictable
The term undefined might imply the wrong interpretation.
Thanks for a great
book,
Bassam