Question

In the context of algorithm analysis, what does "Big O notation" primarily describe?

A The exact running time of an algorithm in milliseconds.
B The amount of memory an algorithm uses.
C The upper bound or worst-case growth rate of an algorithm's time or space complexity as the input size approaches infinity.
D The average-case performance of an algorithm.
E The number of lines of code in an algorithm.
Practice Next

Hey! Ask a query