Invitation to Computer Science 8th Edition

Published by Cengage Learning
ISBN 10: 1337561916
ISBN 13: 978-1-33756-191-4

Chapter 3 - Exercises - Page 146: 34a

Answer

See explanation

Work Step by Step

The worst case will occur when no occurrence of pattern is present in the text but at every step the pattern almost matches with the text for example- text= xxxxxxxxxxxxxx pattern = xxy In this case we will need to do (n-m-1)*(m-1) comparisions.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.