aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorMattias Andrée <maandree@kth.se>2020-06-11 18:49:17 +0200
committerMattias Andrée <maandree@kth.se>2020-06-11 18:49:17 +0200
commitc96722e7105a46f97aba338348aeceb0c3810115 (patch)
treead113f4527738492d79b97e732cf0798caafafb1
parentFirst commit (diff)
downloadbinary-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>
Diffstat (limited to '')
-rw-r--r--README4
1 files changed, 2 insertions, 2 deletions
diff --git a/README b/README
index aa692ca..74529d3 100644
--- a/README
+++ b/README
@@ -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: