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: 25c


Perform a binary search on the list: $[\text { Arturo, Elsa, JoAnn, John, Jose, Lee, Snyder, Tracy }]$ We're searching for Emile. $\bullet$ begin $=$ Arturo; end $=$ Tracy; $m=\mathrm{John}$ $\ \ \ $Compare John to Emile. Emile precedes John. $\ \ \ $Set end to $m-1=$ JoAnn; $\bullet$ begin $=$ Arturo; $e n d=$ JoAnn; $m=$ Elsa; $\ \ \ $Compare Elsa to Emile. Emile follows Elsa (alphabetically). $\ \ \ $Set begin to $m+1=$ JoAnn; $\ \ \ $since beginning $=$ end set Found $=N o$ 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.