Jump to content

Talk:Shift Or Algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Srchvrs (talk | contribs) at 09:33, 13 July 2006 (added comments on shift-and, shift-or and bitap algo issues). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article looks like an almost exact copy of (big parts of) http://www-igm.univ-mlv.fr/~lecroq/string/node6.html#SECTION0060 . If the authors of that text gave permission to include it in Wikipedia (I have my doubts ...), I can't seem to find any note of this and even if they did, isn't there a better article for this subject already (see Bitap algorithm)? - 84.58.238.112 14:28, 11 July 2006 (UTC)[reply]

Moreover, there is some mess among shift-or, bitap and shift-and algorithms. I am going to fix this mess soon. Bitap algorithm is some unofficial name of the shift-and algorithm. It is used in technical descriptions shipped with agrep. Shift-or algortihm is mostly the same as shift-and. It is just a more efficient version.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Shift_Or_Algorithm&oldid=63573282"