It is based on the concept of maximizing register use by storing two values in each register. To modify for use with a search key expected to completely match a value stored in the search range, see Adaptations below. This routine is substantially faster than a sequential search intended to accomplish the same purpose. The search range consists of registers in contiguous order. Stored values are sorted in ascending sequence across the search range.
Stored values are unique across the search range.
The lowest register of the search range . Stack register X The highest register of search range. Values at exit Stack register X Register number where the search key was found. If the search key wasn't found, this value will be that of the search key. No bugs have been identified when this routine is used correctly.