What do you mean by best? Probably you mean optimal, which in this case is linear complexity -- one such algorithm is the Knuth-Morris- Pratt algorithm. The case insensitivity is very easy to get around, just transform the input to lowercase for example, and use your favourite string matching algorithm.
Also, have you tried Google? For such classic questions, there's nothing someone can tell you that Google cannot. On Dec 7 2007, 1:05 pm, erichain <[EMAIL PROTECTED]> wrote: > a.t.t. > > Thx in advance! :-) --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
