S: Boyer-Moore Algorithmus

Thread View: ndh.probleme

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Thomas Schuerger Wed, 10 Apr 1996 18:35

Author: Thomas Schuerger
Date: Wed, 10 Apr 1996 18:35

17 lines
1445 bytes

  Suche dringend den >Boyer-Moore Suchalgorithmus<. Er bietet wohl die
derzeit schnellste Methode, einen String innerhalb eines Textes zu suchen
(oder gibt's was schnelleres?).

  Am liebsten waere mir ein kleiner Sourcecode, es reicht aber auch eine
genaue Erkaerung, wie das theoretisch funktioniert. Bitte nur per PM!

                                                            ___
Ciao,                                                  LCS /  / _______
                                                          /  /_/  ____/
Thomas Schuerger   E-Mail: T.Schuerger@lcs.ndh.com        \___   __/
                       or: Phobos@eratosth.dssd.sub.org       \_/   PGP

CoSysOp of Eratosthenes BBS:  (+49) 0228/230083 V.FC & 239522 V.34/ISDN
=======================================================================
"640K ought to be enough for anybody."
- Bill Gates

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads