Skip to content
CodeWiki
Practice
Paths
Tracks
Cheatsheets
Playground
Glossary
AI era
Search
⌘K
English
English
Chinese
Practice
Paths
Tracks
Cheatsheets
Playground
Glossary
AI era
English
English
Chinese
Practice
/
Quiz
/
CS foundations
/
Algorithmic complexity
A function performs 4n² + 20n + 300 modeled operations. What is its tight asymptotic time…
from Algorithmic complexity
Node 24
beginner
1 min
A function performs 4n² + 20n + 300 modeled operations. What is its tight asymptotic time bound?
Θ(1)
Θ(n)
Θ(n²)
Θ(4n² + 20n + 300) only
Check
Ask AI about this kata
Report an error
previous kata
Why can append to a geometrically growing dynamic array be amortized O(1) even though one…
Quiz
next kata
What does this program print?
Predict the output
A new version is available
Reload