Page 1106 - AP Computer Science A, 7th edition

9. (A) The algorithm uses the fact that array v is sorted smallest to largest. The while loop terminates—which means that the search stops—as soon as v[index] >= key.