GitHub / RobertCarrUTA / C-Multithreaded-Fast-Substring-Finder

This is an extremely fast implementation of the Boyer-Moore substring search algorithm for Windows. It can find a substring at the end of a 112,386,212 character file in 0.003 seconds. This project was primarily an experiment, driven by curiosity to explore speed potential in substring searching. It does not intend to serve practical applications.

JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RobertCarrUTA%2FC-Multithreaded-Fast-Substring-Finder

Topics: boyer-moore-algorithm, c, efficient, multithreading, speed

• Files
• Readme
• Dependencies