Multiple ChoiceBeginner 30s
Binary Search — Complexity
Binary search:
Options
- 1Works on unsorted arrays without preprocessing
- 2Requires a sorted array and runs in O(log n)
- 3Scans elements linearly from the start
- 4Has O(n) complexity in the worst case
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.