Chapter 17.3, Problem 17.11CP

Explanation of Solution

Basic operations:

The basic operation is the initial step in the algorithm and this is otherwise called as basic step.

• Normally, the algorithm executes the basic step in constant time rather than considering about the size of the input.
• So, it means that size of the bound does not affect the efficiency of the operations.
• The complexity of an algorithm can be found out by finding the number of basic steps required for an input.

Comparing the efficiency of an algorithm:

In the given question, one algorithm requires “$10n$” basic operations to process an input