## Invitation to Computer Science 8th Edition

The loop has two conditions which have to be true at the same time. The first condition asks for Found to be $N O$ so it will be true for as long as the name is not found. Even if the name will not be found at all, the loop will be performed no more than 10000 times. This is guaranteed by the second condition that has to be satisfied: $(i \leq 10000)$
The loop has two conditions which have to be true at the same time. The first condition asks for Found to be $N O$ so it will be true for as long as the name is not found. Even if the name will not be found at all, the loop will be performed no more than 10000 times. This is guaranteed by the second condition that has to be satisfied: $(i \leq 10000)$