Developer C++ Leonid Volnitsky has produced a very fast search string C++ implementation. Apparently, according to his criteria to be twice as fast as Boyer-Moore.
Its code has been tested on Linux, after it was not compiled with GCC, but I find Visual Studio C++ Express had no problem compiling and algorithm should work equally well on Windows and, hopefully, as fast.
No comments:
Post a Comment