## Invitation to Computer Science 8th Edition

Published by Cengage Learning

# Chapter 3 - Exercises - Page 144: 23

#### Answer

\begin{array}{l}{\text { To reduce the number of copies, we could modify the algorithm at Step } 11 .} \\ {\text { It is the step that indicates that all elements between the left position, in }} \\ {\text { which a } 0 \text { is encountered, and position } n \text { shall be copied. }} \\ {\text { If we change the interval of elements to be copied from [left, } n ] \text { to [left,legit], }} \\ {\text { we won't copy the redundant } n-l e g i t \text { last elements. }} \\ \\{\text { The new number of copies for the same list would be } 20 \text { . }}\end{array}

#### Work Step by Step

--

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.