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)times it loops
B)basic steps it requires
C)operations it performs
D)variables it uses
E)output statements it has

Question

Quizplus · Accepted Answer

The complexity of an algorithm is typically measured by the number of basic steps it requires, which reflects the time complexity or the number of operations it performs, indicating the efficiency of the algorithm.

We Can Measure the Complexity of an Algorithm That Solves