Exercises 3 and 4 illustrate that for relatively small values of n, algorithms with larger orders can be more efficient than algorithms with smaller orders. Use a graphing calculator or computer to answer these questions.
3. For what values of n is an algorithm that requires n operations more efficient than an algorithm that requires
To find:
The values of n for which the algorithm that requires n operations more efficient than an algorithm that requires
Given information:
Algorithm that requires n operations more efficient than an algorithm that requires
Calculation:
The algorithm that requires n operations more efficient than an algorithm that requires
For the clear explanation, let’s graph the functions