Question

I have an algorithm that runs in O(n )time, where n is the size of the problem. What does "the size of the problem" mean? a. The size of the problem is the number of bytes the data occupies b. The size of the problem is the number of lines in the source code of the program. c. The size of a problem is the number of data items that the algorithm operates upon d. The size of the problem is the depth of nesting of loops in the program.

Answer 1

C

Step-by-step explanation:

In this case n as the size of problem is the number of data items that the algorithm operates upon.