Kingish.com
It's a way of life
Recent blog posts
- Avinash Kaushik: Tracking Non-Ecommerce Sites
- Web Analytics 2.0 - Meet Avinash Kaushik
- 10 reasons why we may not save the world in time
- Top 10 Ways To Save The World
- The Seemingly Impossible is Possible
- Googlewhack!
- George Clinton
- Redirects to Avoid Homepage Duplicate Content
- Using Quantcast Web Site Audience Profiles
- Danny Sullivan Spins Another Site
Boyer-Moore Search
Submitted by Adam King on 12 November, 2006 - 14:19.
Fast String Search Algorithm
This section, including the code, was contributed by Patrick KO Shu-pui.
Download now: BOYER04.ZIP (41.1 k)
Fast String Search Algorithm (Boyer) for Windows/C Programmers version 0.3 (Supports Windows 3.x)
NOTE: The use of this package requires authorisation from the author.
Download now: BOYER04.ZIP (41.1 k)
Bookmark/Search this post with:
Delicious
StumbleUpon
Reddit
Facebook
Google
Yahoo
Technorati
The two "find backwards" functions in this library are flawed.
The library assumes that the skip[] array for searching backwards is the same as for searching forwards.
The test program only works, because it too, has a flaw: it finds a match at the end of the buffer, because that's where the test string is, without using the skip array at all.
Post new comment