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

Comparing algorithms with big O

Rate the time complexity

Report a typo

Suppose you have $n$ different words.

You need to count the number of words that start with "A". To do that, you decide to check each of these words one by one.

Describe the time complexity of this algorithm using big O notation.

Select one option from the list

O(1)

O(\log n)

O(\sqrt{n})

O(n)

___

Create a free account to access the full topic