Click here to Skip to main content
15,907,906 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
Hello I need some advice to compare only the first and second byte of a string and if no match is found, then go to the next string.

I know of the booyer moore horspool string matching algorithm and have successfully used it within one of my applications but now that I am reading strings from a database I feel that the data reader is sufficient or just as quick.

I would be very happy to know if its possible to store your data in a database to then use the booyer moore string matching algorithum to find the match in the database. Hope your following me here

would this approach be faster or slower?
if yes or no please give some kind of example of a match by first byte or database booyer moore search

thank you in advance!!
Ganesan Senthilvel 11-May-12 1:00am    
Is it your college assignment?
Dale 2012 2-Jun-12 19:25pm    

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900