>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Match the descriptions to these complexity reasoning terms: O(1), O(log n), O(n), O(n log n). | SWE Maxx
← Question bank
Algorithms · Matching
Difficulty: Medium
Match the descriptions to these complexity reasoning terms: O(1), O(log n), O(n), O(n log n).
Complexity reasoning
Concept relationships
Choose a match for every item. Use each answer once.
Multiplying linear work per level by logarithmic depth gives n log n total work.
Choose a match
O(log n)
O(n)
O(n log n)
O(1)
Repeated halving reaches one candidate after a number of steps proportional to the logarithm.
Choose a match
O(log n)
O(n)
O(n log n)
O(1)
Direct indexed access uses a bounded amount of work independent of the array's length.
Choose a match
O(log n)
O(n)
O(n log n)
O(1)
The work is proportional to two times n, and constant factors are omitted in Big-O notation.
Choose a match
O(log n)
O(n)
O(n log n)
O(1)
Check answer
More in Algorithms →