We define the ___________ of an algorithm to be f(n) if, for all n and all inputs of length n the execution of the algorithm takes at most f(n) steps.this is a common measure of the efficiency of an algorithm.
A)time complexity
B)one-way function
C)timing attack
D)OAEP

Question

Quizplus · Accepted Answer

Time complexity is the term used to define the number of steps an algorithm takes in terms of the input size (n), making it a measure of the efficiency of the algorithm.

We Define the ___________ of an Algorithm to Be F(n)