Java Quiz
10 questions · no time limit
0:00
ALGORITHMS AND COMPLEXITY
Question 1 of 10
No time limit
Current
Answered
Flagged
Not seen
PASSAGE
An immutable list of n account numbers is searched q times. The current implementation performs a linear scan for every query. A proposed implementation sorts the list once and uses binary search for every query.
Ignoring constant factors, under which condition does the proposed implementation provide an asymptotic advantage over repeated linear scans?
YOUR PROGRESS
10
QUESTIONS
Ready when you are
Answer in any order. Your progress shows here as you go.
QUESTIONS
KEYBOARD
Pick an answer ABCD
Next question ↵→
Previous ←
Flag for review F
Answers save as you go · flagged questions come back at the end