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

Complexity cases and how to use them

Theory

Truth about algorithms

Report a typo

Let's say that algorithm $a$ is more efficient than algorithm $b$ in terms of Big-O notation. Knowing this much, can you choose all true statements among the following ones?

Select one or more options from the list

If the algorithms have different average cases, then they can't have the same worst cases

a

has logarithmic complexity and

b

has quadratic complexity, then

b

is worse than

a

The complexity graph of the algorithm

a

is closer to the x-axis than the complexity graph of the algorithm

b

The complexity graph of the algorithm

a

grows faster than the complexity graph of the algorithm

b

___

Create a free account to access the full topic