2. Consider the brute force string matching algorithm and the following string: GOOD MORNING_GOOD_DAY_GOOD_NIGHT a. Use...

 

Transcribed Image Text:

2. Consider the brute force string matching algorithm and the following string: GOOD MORNING_GOOD_DAY_GOOD_NIGHT a. Use the algorithm to find the substring GOOD_DAY. Be sure to show your work? (3 points) b. How many comparisons were made looking for the above substring? (1 point) C. If m is the length of some string, and n is the length of a potential substring, state the worst-case running time (in terms of m and n) to search for the potential substring. (1 point) 2. Consider the brute force string matching algorithm and the following string: GOOD MORNING_GOOD_DAY_GOOD_NIGHT a. Use the algorithm to find the substring GOOD_DAY. Be sure to show your work? (3 points) b. How many comparisons were made looking for the above substring? (1 point) C. If m is the length of some string, and n is the length of a potential substring, state the worst-case running time (in terms of m and n) to search for the potential substring. (1 point)

Answer rating: 100% (QA)

a Lets use the brute force string matching algorithm to find the substring ... View the full answer