BoyerMooreGalil() may be less efficient than BoyerMoore() because for patterns with no periods it checks the condition in an if statement in each iteration of the outer while loop. Change the algorithm so that a driver function preprocesses the pattern to check for a period, and if a period is found, it calls BoyerMoore(); otherwise, it calls BoyerMooreGalil() without the if statement.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here