Invitation to Computer Science 8th Edition

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

Chapter 3 - Exercises - Page 144: 19


\begin{equation} n=81000 \end{equation}

Work Step by Step

\begin{array}{l}{\text { The value of } n \text { for which the number of instructions executed is the same is }} \\ {\text { given by: }} \\ {\qquad 0.003 n^{2}=243 n \Longrightarrow n=81000} \\ {\text { Thus, for } n>81000, \text { The linear time algorithm is more efficient than the }} \\ {\text { quadratic algorithm. }}\end{array}
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.