Page 1118 - AP Computer Science A, 7th edition
P. 1118
10 5 15
15. (A)30,000=1000×30≈2 ×2 =2 .Sinceasuccessful binary search in the worst case requires log2 n iterations, 15 iterations will guarantee that key is found. (Note that 30,000 < 210 × 25 = 32,768.)
