Jump to content

Talk:Turbo Boyer–Moore algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Bisqwit (talk | contribs) at 11:34, 23 September 2006 (positive vote for merging). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Example implementation?

[edit]

It would be nice to see a working example implementation of this algorithm. --Bisqwit 08:13, 6 June 2006 (UTC)[reply]

I am in favor of merging to Boyer–Moore string search algorithm. --Bisqwit 11:34, 23 September 2006 (UTC)[reply]