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

Big O: how to count it

Calculating time complexity

Report a typo

Suppose you have to perform $n$ times an algorithm whose time complexity is $O(n\log n)$ . What will be the time complexity of this?

Select one option from the list

___

Create a free account to access the full topic