<html>
<head>
<meta content="text/html; charset=windows-1252"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
Yes, but the little known X-Search algorithm is slightly more
efficient.<br>
<br>
<div class="moz-cite-prefix">On 1/29/2017 10:04 AM, Bob Walkden
wrote:<br>
</div>
<blockquote
cite="mid:AMSPR05MB5491B7C3651E44446E2CCF0F7480@AMSPR05MB549.eurprd05.prod.outlook.com"
type="cite">
<pre wrap="">OK, I believe the Boyer-Moore algorithm is the most efficient. There is an
implementation in Wirth's Algorithm's and Data Structures, section 1.9.6.
<a moz-do-not-send="true" class="moz-txt-link-freetext" href="http://www.ethoberon.ethz.ch/WirthPubl/AD.pdf">http://www.ethoberon.ethz.ch/WirthPubl/AD.pdf</a>
<a moz-do-not-send="true" class="moz-txt-link-freetext" href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm</a>
B</pre>
</blockquote>
<br>
<div class="moz-signature">-- <br>
Danforth of the Greenwood</div>
</body>
</html>