Date: Mon, 1 Oct 2001 23:41:19 -0500 From: Will Andrews <will@physics.purdue.edu> To: "Andrew L. Neporada" <andrew@nas.dgap.mipt.ru> Cc: freebsd-hackers@freebsd.org Subject: Re: current strstr(3) implementation is slow Message-ID: <20011001234119.D24038@squall.waterspout.com> In-Reply-To: <Pine.BSF.4.21.0110020807550.33266-100000@nas.dgap.mipt.ru> References: <Pine.BSF.4.21.0110020807550.33266-100000@nas.dgap.mipt.ru>
next in thread | previous in thread | raw e-mail | index | archive | help
On Tue, Oct 02, 2001 at 08:32:12AM +0400, Andrew L. Neporada wrote: > If the length of substring is M and the length of string is N, then > current algorithm takes O(N*M) operations. > It is possible to perform search faster -- O(N+M) operations only. Please send-pr them. -- wca To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20011001234119.D24038>