Learning JavaScript Data Structures and Algorithms - Third Edition

The binary search

The binary search algorithm works similar to the number guessing game, in which someone says "I'm thinking of a number between 1 and 100". We will begin by responding with a number, and the person will say "higher", "lower", or that we got it right.

To make the algorithm work, the data structure needs to be sorted first. These are the steps that the algorithm follows:

1. A value is selected in the middle of the array.
2. If the value is the one we are looking for, we are done (the value was found).
3. If the value we are looking for is less than the selected one, then we will go back to step 1 using the left subarray (lower).
4. If the value we are looking for is bigger than the selected one, then we will go back to step 1 using the ...