> search for 'efghmnop'
> in 'abcdefghijklmnopqrstuvwxyzabcdefghmnop'
>
> Take the last letter of the searched for substring, p.
>
> Pick a possible substring endpoint in the large string.
> This starts out at an offset from the beginning of the
> large string. The offset is the length of the substring.
>
> So, in the above case, you start by comparing p and h.
>
> That fails. Next, given that there is no l in the substring,
Oops. I'll leave working out the paragraph I accidentally
deleted as an exercise to readers...
--
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
