I have an algorithm that runs in On²)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.

Question

Quizplus · Accepted Answer

The size of the problem refers to the amount of data items that the algorithm needs to process, so option C is the best choice. Option A is incorrect because the amount of data is not always directly related to the size of the problem. Option B is incorrect because the lines of the source code do not necessarily impact the size of the problem. Option D is incorrect because the depth of nesting of loops may be related to the algorithm's runtime, but it is not an accurate measure of the size of the problem.

I Have an Algorithm That Runs in On2)time, Where N

I Have an Algorithm That Runs in On²)time, Where N