@geoffcox/binary-search demo

This demo lets you play with the binary search algorithm.

You can create sequence of numbers, remove some of the values, and then search for a value.

If the value isn't found, the algorithm tells you the low/high range where the number would have been if it was in the array.

1. Create an array of numbers to search

Array length

Starting number

Randomly remove item count

[ ]

2. Choose a number to find

Number to find

3. Run the search

We expect log₂(length) => 5 comparisons.