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.