The BoyerâMoore string search algorithm is a particularly efficient string searching algorithm, and it has been the standard benchmark for the practical string search literature.[1] It was developed by Bob Boyer and J Strother Moore in 1977. The algorithm preprocesses the target string (key) th

IanLewis のブックマーク 2010/06/03 09:21

<blockquote class="hatena-bookmark-comment"><a class="comment-info" href="https://b.hatena.ne.jp/entry/27375600/comment/IanLewis" data-user-id="IanLewis" data-entry-url="https://b.hatena.ne.jp/entry/s/en.wikipedia.org/wiki/Boyer%E2%80%93Moore" data-original-href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore" data-entry-favicon="https://cdn-ak2.favicon.st-hatena.com/64?url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FBoyer%25E2%2580%2593Moore" data-user-icon="/users/IanLewis/profile.png">Boyer–Moore - Wikipedia</a><ul class="comment-tag" style="list-style: none; margin: 0px;"><li style="float: left">[<a href="https://b.hatena.ne.jp/q/algorithm">algorithm</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/string">string</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/search">search</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/text-processing">text-processing</a>]</li></ul><br><p style="clear: left">The BoyerâMoore string search algorithm is a particularly efficient string searching algorithm, and it has been the standard benchmark for the practical string search literature.[1] It was developed by Bob Boyer and J Strother Moore in 1977. The algorithm preprocesses the target string (key) th</p><a class="datetime" href="https://b.hatena.ne.jp/IanLewis/20100603#bookmark-27375600"><span class="datetime-body">2010/06/03 09:21</span></a></blockquote><script src="https://b.st-hatena.com/js/comment-widget.js" charset="utf-8" async></script>

このブックマークにはスターがありません。
最初のスターをつけてみよう！