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

Comparing algorithms with big O

Theory

Actions lead to consequences

Report a typo

Match the time complexity class with the general description of an algorithm from this class:

Match the items from left and right columns
O(1)O(1)
O(log⁡n)O(\log n)
O(n)O(n)
O(2n)O(2^n)
Iterates every input element only once
Divide the input size into halves at each step
Scan all the subsets of the input elements
Constant number of operations
___

Create a free account to access the full topic