Algorithms and Data Structures · Junior · Question 5 of 75

Which complexity grows the slowest as n increases?

Explanation

Logarithmic growth is very slow: doubling n adds just one step. For a million elements log₂ n is about 20. O(n) and O(n log n) grow much faster.

Further reading

Problem with a question

Algorithms and Data Structures · Junior · question 5

Test yourself

Take the Algorithms and Data Structures · Junior quiz: questions and options are shuffled, and you get a review of your mistakes at the end.

Take this quiz