Computer Science: An Overview: Global Edition (12th Edition)

Published by Pearson Higher Education
ISBN 10: 1292061162
ISBN 13: 978-1-29206-116-0

Chapter 5 - Algorithms - Chapter Review Problems - Page 265: 25

Answer

The interrogated letters will be H, L and J when binary search is done on J. When Z is searched the interrogated letters will be H, L, N and O

Work Step by Step

The binary search algorithm checks the middle element and then eliminates half of the input and then check the middle element of remaining half and so on. The above answers are based on this.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.