G11 SUPER GIO
123
03
CHALLENGE MISSIONalgorithms, data structures, and system behavior

algorithms, data structures, and system behavior

INDEPENDENT DEFENSEINDEPENDENT TRANSFER

Analyze scale

Algorithm A takes about n^2 operations; B takes about n log2(n). At n=1024, A is about 1,048,576 operations and B about 10,240.

  1. Compare growth at the target scale.
  2. Constants still matter in real systems.
  3. Asymptotic behavior explains the widening gap.

Which defense of B is strongest?

MODELAlgorithm Trace Deck
DATA
PROVEChoose with evidence
CLUE

Pause. Find what matters. Then make your move.