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 linear scan stops when it finds its target. Which statement is precise?
from Algorithmic complexity
Node 24
beginner
1 min
A linear scan stops when it finds its target. Which statement is precise?
Its time is always Θ(1).
Its best case is Θ(1), while its worst case is Θ(n).
Its average case is automatically Θ(n / 2).
Its worst case is Θ(n²).
Check
Ask AI about this kata
Report an error
previous kata
Review generated dispatch batching
Review AI code
next kata
Spot the bug in the duplicate check
Spot the bug
A new version is available
Reload