Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!cbmvax!amix!undrground!ryan From: undrground!ryan@amix.commodore.com (Ryan Sheftel) Newsgroups: comp.sys.amiga.programmer Subject: Re: Source code for search Message-ID: Date: 7 Jun 91 05:01:00 GMT References: <492@regina.uregina.ca> Organization: The Underground - Pennsylvania Lines: 22 plummer@hercules.cs.uregina.ca (Dave Plummer) writes: > Would anyone happen to have source code for a (very) fast search routine? > Basically, what I need is something like strstr(), but I need to be able > to modify it to make it non-case sensitive. I'm basically looking through > a small (512-2048 bytes) buffer for an ASCII string. > > Your code or directions greatly appreciated! > > - Dave > > Why does this only append my sig 1/6 times? I know not why. Well, the fastest search I know of for a sorted list is the binary search. But is the list is unsorted, I believe the only way to go about it is for (X = 0; X < MAX; X++) ---------- Ryan Sheftel UUCP: uunet!cbmvax!amix!undrground!ryan Internet: undrground!ryan@amix.commodore.com