Chapter Guide

Chapter Guide

Chapter 1: Binary Search vs Linear Search

Concepts: Binary search, linear search, Big O notation

Scenes:

1. Linear search O(n) visualization
2. Binary search O(log n) visualization
3. Side-by-side comparison
4. Big O growth curves

---

Chapter 2: Arrays, Linked Lists, Selection Sort

Concepts: Memory layout, array vs linked list, selection sort

Scenes:

1. Array memory (contiguous blocks)
2. Linked list memory (scattered with pointers)
3. Access time comparison
4. Selection sort step-by-step

---

Chapter 3: Recursion

Concepts: Base case, recursive case, call stack

Scenes:

1. Factorial example
2. Call stack visualization
3. Stack overflow warning
4. Countdown recursion

---

Chapter 4: Divide & Conquer, Quicksort

Concepts: D&C strategy, partitioning, pivot selection

Scenes:

1. Farm problem (Euclid's algorithm)
2. Recursive sum
3. Quicksort concept
4. Pivot comparison (first vs random vs median)
5. Big O analysis

---

Chapter 5: Hash Tables

Concepts: Hash functions, O(1) lookup, collisions

Scenes:

1. Hash function visualization
2. Phone book example
3. Duplicate detection
4. Caching (memoization)
5. Collision handling (chaining)
6. Load factor

---

Chapter 6: Breadth-First Search

Concepts: Graphs, BFS algorithm, shortest path

Scenes:

1. Graph introduction (nodes, edges)
2. Mango seller problem
3. Queue-based exploration
4. Shortest path guarantee
5. Implementation walkthrough

---

Chapter 7: Dijkstra's Algorithm

Concepts: Weighted graphs, shortest weighted path

Scenes:

1. BFS vs Dijkstra comparison
2. Step-by-step walkthrough
3. Cost and parent tracking
4. Trading example (Book → Piano)
5. Negative weights warning
6. Applications

---

Chapter 8: Greedy Algorithms

Concepts: Greedy strategy, approximation, NP-complete

Scenes:

1. Classroom scheduling (greedy optimal)
2. Knapsack problem (greedy approximate)
3. Set covering (radio stations)
4. Traveling salesperson (factorial explosion)
5. NP-complete recognition
6. Summary