Invitation to Computer Science 8th Edition

Published by Cengage Learning
ISBN 10: 1337561916
ISBN 13: 978-1-33756-191-4

Chapter 3 - Exercises - Page 145: 25b


Perform a binary search on the list: $[\text { Arturo, Elsa, JoAnn, John, Jose, Lee, Snyder, Tracy }]$ We're searching for Tracy. $\bullet$ begin $=$ Arturo; end $=$ Tracy; $m=$ John; $\ \ \ $Compare John to Tracy. Tracy follows John. $\ \ \ $Set begin to $m+1=$ Jose; $\bullet$ begin $=$ Jose; $e n d=$ Tracy; $m=$ Lee; $\ \ \ $Compare Lee to Tracy. Tracy follows Lee. $\ \ \ $Set begin to $m+1=$ Snyder; $\bullet$ begin $=$ Snyder; end $=$ Tracy; $m=$ Tracy; $\ \ \ $Compare Tracy to Tracy. $m=$ Tracy $\ \ \ $Set Found $=Y e s$ and stop the algorithm.

Work Step by Step

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.