# Mission: Big-O for the BUILD Camp Room

**Learner:** the BUILD Camp Mentor Spotlight audience (4 July 2026), guided live by Zain Fathoni.

## Why

Prove — live, in one hour — that CS fundamentals can be learned *faster with AI, not skipped because of it*. The room walks out able to judge whether a piece of code (theirs or an AI agent's) will survive growing input, using Big-O as the shared vocabulary. This is the fallback case study for the "Fundamental CS for AI Era" talk demo; the source material is Zain's own 2020 guest lecture at Politeknik Negeri Jember.

## Success looks like

- Anyone in the room can explain why a courier route with 20 stops is a fundamentally different problem than one with 5 stops — without hand-waving.
- Given a simple loop, the room can derive T(n) by counting the typical operation, then reduce it to its asymptotic form by dropping constants and lower-order terms.
- The room can order the common growth functions (1, log n, n, n log n, n², 2ⁿ, n!) from slowest- to fastest-growing.
- At least one wrong quiz answer visibly steers what gets taught next — demonstrating quizzes as speed regulators.

## Constraints

- One live session, ~60 minutes, structured as Pick → Mission → Learn → Quiz.
- The audience answers the quizzes; Zain only types. Lessons and questions are used as generated (ground rule of the demo).
- Mixed audience: developers and non-developers; no assumed math background beyond exponents.
- Lessons in English (matching the talk), keeping the Indonesian source terms — e.g. *mangkus* (efficient) — where they help.

## Out of scope

- Formal proofs of asymptotic bounds; limits notation.
- Space complexity S(n) beyond a mention (the source deck defines it; the hour is about time).
- Amortized analysis, recurrences, and master theorem — future sessions, not this room's zone yet.