diff options
| author | Mattias Andrée <maandree@kth.se> | 2020-06-11 18:49:17 +0200 |
|---|---|---|
| committer | Mattias Andrée <maandree@kth.se> | 2020-06-11 18:49:17 +0200 |
| commit | c96722e7105a46f97aba338348aeceb0c3810115 (patch) | |
| tree | ad113f4527738492d79b97e732cf0798caafafb1 | |
| parent | First commit (diff) | |
| download | binary-multisearch.h-c96722e7105a46f97aba338348aeceb0c3810115.tar.gz binary-multisearch.h-c96722e7105a46f97aba338348aeceb0c3810115.tar.bz2 binary-multisearch.h-c96722e7105a46f97aba338348aeceb0c3810115.tar.xz | |
m readme1.0
Signed-off-by: Mattias Andrée <maandree@kth.se>
| -rw-r--r-- | README | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -1,8 +1,8 @@ Binary multisearch Description: - Given a sorted list of unique items, find their in another - list sorted list their position or if missing where they + Given a sorted list of unique items, find in another + sorted list their position or if missing where they ought to be inserted. Both list must allow random access. Complexity: |