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: 4

Answer

If $m > n$, then $n - m + 1$ $\leq$ 0. Because the value of $k$ is set to 1 right before the outer while loop, the condition k $\leq$ $(n - m + 1)$ is $false$, the loop is not executed, and the algorithm terminates with no output.

Work Step by Step

If $m > n$, then $n - m + 1$ $\leq$ 0. Because the value of $k$ is set to 1 right before the outer while loop, the condition k $\leq$ $(n - m + 1)$ is $false$, the loop is not executed, and the algorithm terminates with no output.
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.