Chapter 4, Problem 8R

Explanation of Solution

To determine the value of $n_0$:

It is given that the number of operations executed by the algorithm “A” is “$40n^2$ ” and for algorithm “B” is $2n^3$.

• Here, the algorithm start out with “A” as higher and after that while crossing at some point it makes the algorithm B as higher.
• So, it is necessary to determine the point where it exactly cross and for that let us equate the above two equations.

$\begin{array}{l}40n^2=2n^3\hfill \\ 20n^2=n^3(\because \hfill \end{array}$