barravea@lafcol.UUCP (Barravecchio Anthony J) (03/22/90)
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.