diff options
| -rw-r--r-- | README | 8 | ||||
| -rw-r--r-- | binary-multisearch.h | 4 | ||||
| -rw-r--r-- | config.mk | 4 |
3 files changed, 8 insertions, 8 deletions
@@ -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. diff --git a/binary-multisearch.h b/binary-multisearch.h index e0f482a..3931e8f 100644 --- a/binary-multisearch.h +++ b/binary-multisearch.h @@ -15,8 +15,8 @@ * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */ -#ifndef BINARY_MUTLISEARCH_H -#define BINARY_MUTLISEARCH_H +#ifndef BINARY_MULTISEARCH_H +#define BINARY_MULTISEARCH_H #define __STDC_WANT_LIB_EXT1__ #include <stddef.h> @@ -1,7 +1,7 @@ PREFIX = /usr -CC = cc +CC = c99 CPPFLAGS = -D_DEFAULT_SOURCE -D_BSD_SOURCE -D_XOPEN_SOURCE=700 -D_GNU_SOURCE -CFLAGS = -std=c99 -Wall -g +CFLAGS = LDFLAGS = |