aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorMattias Andrée <m@maandree.se>2026-03-24 19:53:42 +0100
committerMattias Andrée <m@maandree.se>2026-03-24 19:53:42 +0100
commitbf0ec024c6eac8fc529099feb80037962226973d (patch)
treec89c7a37d7b3e3612aee42c0714b55744a8883a1
parentm fixes (diff)
downloadbinary-multisearch.h-master.tar.gz
binary-multisearch.h-master.tar.bz2
binary-multisearch.h-master.tar.xz
Signed-off-by: Mattias Andrée <m@maandree.se>
-rw-r--r--README2
1 files changed, 1 insertions, 1 deletions
diff --git a/README b/README
index 5cf6e48..65396bf 100644
--- a/README
+++ b/README
@@ -9,7 +9,7 @@ Complexity:
n = number of elements in target list
m = number of elements to locate
- Time complexity: O(S(n) + m)
+ Time complexity: O(m S(n/m) + m)
S = time complexity function of underlying search algorithm,
e.g. S(n) = O(log n) in average case for binary search given O(1) comparison.