Hello
as usual I am lazy and I think that it may be easier just to ask
everybody here and wait for answers. :)
Here it is, could anybody tell me what are the basic algorithms used
by SEARCH in the variuous implementations? Is it
Knuth-Morris-Pratt? Boyer-Moore? What else?
For the time being I am happy using the standard SEARCH function, but
knowing what to expect may save me some work.
Thanks
--
Marco Antoniotti ===========================================