CS CONTENT WORKFLOW

CONCEPT BREAKDOWN: Binary Search
→ Prerequisite knowledge: sorted arrays, logarithms
→ Complexity class: O(log n) time, O(1) space

SECTION STRUCTURE (12-min video)
1. The problem (2 min)
   - Real example: finding a word in a phone book
   - Show brute force taking too long

2. The algorithm (4 min)
   - Pseudocode walkthrough
   - Visual trace on example array [1,3,5,7,9,11,13]
   - Why it works (elimination strategy)

3. Implementation (3 min)
   - Working code in Python (10 lines)
   - Common mistakes: off-by-one error with midpoint

4. Complexity analysis (2 min)
   - Why O(log n) better than O(n)
   - Concrete comparison: 1 million items = 20 comparisons max

5. Practice problem (1 min)
   - "Find the first occurrence in duplicates"
   - Hint given, full solution at end

DELIVERY ASSETS
→ Animated diagram: array splitting at each step
→ Highlighted code with annotations
→ Timing breakdown (when to teach, when to code)

BEST PRACTICES
- Single concept per piece (resist scope creep)
- Code examples < 20 lines maximum
- Tested on people outside your field (target audience)