Invitation to Computer Science 8th Edition

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

Chapter 2 - 2.4 - Conclusion - Practice Problems - Page 85: 6

Answer

Yes, it will work correctly. The quantity $(n - m + 1)$ evaluates to $1$. Since $k$ is initialized to $1$, the test $k \leq (n - m + 1)$ will initially evaluate to $True$ and the loop will be executed. The text and the pattern will be matched beginning at position $1$. Then when $k$ is incremented to $2$, the test will become $false$ and we will exit the loop, as desired.

Work Step by Step

Yes, it will work correctly. The quantity $(n - m + 1)$ evaluates to $1$. Since $k$ is initialized to $1$, the test $k \leq (n - m + 1)$ will initially evaluate to $True$ and the loop will be executed. The text and the pattern will be matched beginning at position $1$. Then when $k$ is incremented to $2$, the test will become $false$ and we will exit the loop, as desired.
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.