Invitation to Computer Science 8th Edition

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.
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.