We can measure the complexity of an algorithm that solves a computational problem by determining the number of ________ for an input of size n.
A) output statements it has
B) times it loops
C) basic steps it requires
D) variables it uses
E) operations it performs

Question

Quizplus · Accepted Answer

The complexity of an algorithm is typically measured by the number of basic steps it requires, which often correlates with the number of operations it performs.

We Can Measure the Complexity of an Algorithm That Solves