A fixed point in an array is an element whose value equals its index. This animation demonstrates how binary search can efficiently find a fixed point in a sorted array.
We're searching the array: [-10, -1, 0, 3, 10, 11, 30, 50, 100]