On 2017-06-17, at 13:58, Alan Atkinson wrote:
> The time to do compares is likely to pale into insignificance compared to
> looping around a two dimensional unsorted array, unless the sizes are
> trivial...
>
> I'd be inclined to have a cli/clc pair for each element.
> I'd also be thinking hard about sorting or indexing the array being searched.
>
See also:
https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm
https://en.wikipedia.org/wiki/String_searching_algorithm
Throw in a couple wildcards and a CLC matrix becomes enormous. Boyer-Moore
can be extended for wildcards, but that's getting perilously close to regex.
-- gil
