Section: Lesson 2: Memory Basics — stack vs heap and performance implications | Iaido - Algorithms (FREE version) | WinAgainstAI

WinAgainstAI

Section outline

This lesson links how programs live in memory to both correctness risks (like aliasing and recursion crashes) and performance reality (like what the RAM model hides).
- Select activity Micro-topic 2 A: Values vs references — the silent source of bugs
  
  Micro-topic 2 A: Values vs references — the silent source of bugs
  
  Goal: Build a practical mental model: primitive values behave like copies; objects/arrays behave like references; assignments can create aliasing; bugs explode when you don’t notice.
- Select activity Iaido Algorithms WB L2 2A FREE v2
  
  Iaido Algorithms WB L2 2A FREE v2 SCORM package
- Select activity Micro-topic 2 B: Stack thinking — recursion, base cases, and crash discipline
  
  Micro-topic 2 B: Stack thinking — recursion, base cases, and crash discipline
  
  Goal: Understand recursion as a structured tool (not spooky magic): base case, smaller subproblem, and why runaway recursion causes failure.
- Select activity Iaido Algorithms WB L2 2B FREE v2
  
  Iaido Algorithms WB L2 2B FREE v2 SCORM package