| Description: | Algorithm for efficiently searching for multiple items |
| Status: | Complete |
| Source: | https://git.maandree.se/binary-multisearch.h |
| Latest release: | 1.0.1 |
| License: | ISC License (Internet Systems Consortium license) |
| Written in: | C (ISO C) |
Given a sorted list of unique items, this algorithm finds in another sorted list their position or if missing where they ought to be inserted. Both list must allow random access.