From 97984119a2509686f18ca6bebff75a58294069be Mon Sep 17 00:00:00 2001 From: Mattias Andrée Date: Sun, 22 Feb 2026 13:41:30 +0100 Subject: m fixes MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Signed-off-by: Mattias Andrée --- README | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'README') diff --git a/README b/README index 74529d3..5cf6e48 100644 --- a/README +++ b/README @@ -3,14 +3,14 @@ Binary multisearch Description: 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. + ought to be inserted. Both lists must allow random access. Complexity: n = number of elements in target list - m = number of element to locate + m = number of elements to locate Time complexity: O(S(n) + m) - S = time complexity function of underlaying search algorithm, + 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. Auxiliary space complexity: @@ -21,4 +21,4 @@ Notes: In online version, positions for elements are returned in arbitrary (deterministic) order, rather than sequential. -I wrote this algorithm back in Feburary 2013. +I wrote this algorithm back in February 2013. -- cgit v1.2.3-70-g09d2