Subject: RE:Find&Replace
From: sam th (sam@uchicago.edu)
Date: Sun Aug 06 2000 - 14:47:20 CDT
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
On Sat, 5 Aug 2000, Allan Clark wrote:
> The algorithm that I implemented is Knuth-Morris-Pratt and is proven to run
> in O(n + m) time where n is the size of the text and m is the size of the
> pattern. This is because the prefix function can be computed in O(m). The
> algorithm that is currently used I don't think can do this, maybe I'm wrong,
> either way I think the KMP is neater than the current solution and easier to
> follow. Let me know what you think.
Well, I like it. So it's been committed. Thanks. :-)
sam th
sam@uchicago.edu
http://www.abisource.com/~sam/
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.1 (GNU/Linux)
Comment: For info see http://www.gnupg.org
iD8DBQE5jcDKt+kM0Mq9M/wRAmNWAKDGm7ZyjwiGbOexbtWqn1dZhGZ6zQCdHY+8
zqRbNvJ7TL+KsDSeg6WTEVo=
=IljC
-----END PGP SIGNATURE-----
This archive was generated by hypermail 2b25 : Sun Aug 06 2000 - 13:47:37 CDT