Analyzing an algorithm with Big O notation is useful for predicting:_______.
A. The accuracy of the computation
B. The time required to write the required code
C. The performance of the algorithm as different amounts of inputs are processed
D. Both A and C

Respuesta :

Answer:

C. The performance of the algorithm as different amounts of inputs are processed

Explanation:

Analyzing an algorithm with Big O notation is useful for predicting:

The performance of the algorithm as different amounts of inputs are processed