Binary search
- The Interval Index is also the index the target would come after in sorted order, or the number of values that precede or match the target
- Binary search repeatedly rules out half the possible indices
- To avoid the cost of branch misprediction, it's better not to test whether the target matches one of the midpoints while searching
- This method checks exactly
⌈2⍟n+1
principal argument values