Computer scienceAlgorithms and Data StructuresIntro to algorithms and data structuresUnderstanding algorithms and complexity analysis

Best, average, and worst cases

Theory

Neither the best nor the worst

Report a typo

Suppose you have an algorithm whose time complexity is $O(n)$ for all possible inputs and whose input size is $n$ . What would the average time complexity of such an algorithm be?

Select one option from the list

O(n)

O(n^2)

O(n^n)

Depends on the number of possible inputs

___

Create a free account to access the full topic