Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!usc!brutus.cs.uiuc.edu!psuvax1!rutgers!netnews.upenn.edu!vax1.cc.lehigh.edu!vlsi3b15!lafcol!barravea
From: barravea@lafcol.UUCP (Barravecchio Anthony J)
Newsgroups: comp.lang.fortran
Subject: Boyer & Moore Algorithm
Keywords: computers, programming
Message-ID: <1958@lafcol.UUCP>
Date: 21 Mar 90 16:29:58 GMT
Distribution: usa
Organization: Academic Computer Center, Lafayette College
Lines: 7


     I have recently read about the Boyer & Moore algorithm
for quick searches. Does anyone know of already written code
for this technique? Code in FORTRAN would be especially
helpful.
     My UNIX address is Rutgers!Lafcol!Barravea and my
BITNET address is BA10@Lafaycol.