Invitation to Computer Science 8th Edition

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

Chapter 3 - Exercises - Page 140: 4b

Answer

\begin{array}{l}{\text { Find the number of matches by subtracting the number of winners out of }} \\ {\text { the initial number of competitors: } 342-1=341}\end{array} ---- \begin{array}{l}{\text { Following the logic presented in the second algorithm: Each match results }} \\ {\text { in exactly one loser, so there must be the same number of matches as losers }} \\ {\text { in the tournament. }} \\ \\ {\text { How do we find the number of losers? By subtracting the number of winners }} \\ {\text { out of the initial number of competitors: } 342-1=341 .} \\ \\ \text{ Now we know there are 341 matches, a result we already know is correct.} \end{array}

Work Step by Step

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