## Invitation to Computer Science 8th Edition

Published by Cengage Learning

# Chapter 3 - Exercises - Page 145: 25a

#### Answer

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

#### Work Step by Step

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

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.