🚀 go-pugleaf

On Wed, 20 Jun 2001 16:55:16 +0200, Steffen wrote:

> I'am going to realize a search-funtion which should find
> a part of a string in another string.

> I should code this in a recursive function.

I don't think you want to code this as a recursive function.  Recursion 
adds quite a bit of overhead, and it does not really gain you anything 
in this case.  Recursion should be avoided unless its use provides a 
clear benefit.

But unless the interest is academic, you are probably much better off 
using some code that has already been written, rather than roll your 
own.  Unless you know a lot about searching and have a lot of time on 
your hands, chances are that you will not be able to write a search 
algorithm better than what you can find already written.

One library that will do what you want is Jakarta ORO:

    http://jakarta.apache.org/oro/index.html

If the interest is academic, then a Java language newsgroup is not the 
best place to be looking.  In that case, one great place to start is 
Donald Knuth's classic "Art of Computer Programming" series.  You will 
find it in any library that has technical books, and if you have $130 
to spare, it would make a great addition to your computer science 
bookshelf.

Any search engine should also find plenty of material on search 
algorithms for you.  Be sure not to miss looking up the Boyer-Moore 
search algorithm.

-- 
Regards,

John McGrath [TeamB]

---------------------------------------------------
Before sending me e-mail, please read:
    http://www.JPMcGrath.net/newsgroups/e-mail.html