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

Complexity cases and how to use them

What is n?

Report a typo

What does the term $n$ signify in the context of Big-O notation, when an algorithm has a complexity of $O(n \cdot log \: n)$ ?

Select one option from the list

Dimension of input data

Memory that the algorithm occupies in bits

Number of parameters that are fed into the program

Running time in seconds

___

Create a free account to access the full topic