Boyer-Moore Algorithm

This project is a comparison of Boyer-Moore and Naïve algorithms for string search.

Run the following examples:

java StringSearch -p "eu" -t "Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut sed aliquet nisl. Etiam eu congue massa, sit amet pharetra lectus."

java StringSearch -p "eu congue massa, sit amet" -t "Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut sed aliquet nisl. Etiam eu congue massa, sit amet pharetra lectus."

java StringSearch -p "BCCCCC" -t "CCCCCCCCCCCCCCCCC"