Revise the implementation for the Boyer-Moore algorithm in Listing 22.15 StringMatchBoyerMoore. java to test where a mismatch character is in the pattern in O(1) time using a set that consists of all the characters in the pattern. If the test is false, the algorithm can shift the pattern past the mismatched character.

Data from Listing 22.15

Transcribed Image Text:

Enter a string s1: Mississippi Pener Enter a string s2: sip Jener matched at index 6