Answer:
C. the performance of the algorithm as different amounts of inputs are processed
Explanation:
During the classification of algorithms, the Big O notation can be used to classify these algorithms according to how their run time or space requirements grow as the input size grows. It is quite useful when we only have upper bound on time complexity of an algorithm.
Therefore in order to predict the performance of an algorithm when it is being analysed, different amounts of inputs will need to be processed.
