C Plus Plus 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 embedded application uses a simple O(n2)O(n^2) routine for inputs limited to n≤64n \le 64. Measurements on the target device show a worst-case time of 3030 microseconds, while the complete operation has a 11-millisecond deadline. An O(nlog⁡n)O(n \log n) replacement requires dynamic allocation and measures 6060 microseconds over the entire permitted input range.
Which decision best distinguishes practical optimization from relying only on asymptotic notation?
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