Loading repovive.com/roadmaps/greedy-algorithms
Roadmaps
Greedy Algorithms
Proving Greedy Correctness
Problemset
Discussion
AI Helper
Introduction to Greedy
0/36
Proving Greedy Correctness
0/42
1
Intro
2
The Problem with Intuition
3
Two Proof Techniques
4
Vocabulary - Exchange Argument
5
Exchange Argument Structure
6
Quiz: Exchange Argument
7
Example - Activity Selection Exchange
8
Activity Selection - The Exchange
9
Activity Selection - Completing the Proof
10
When Exchange Works Best
11
Vocabulary - Stays Ahead Argument
12
Stays Ahead Structure
13
Quiz: Stays Ahead
14
Example - Activity Selection Stays Ahead
15
Activity Selection - Base Case
16
Activity Selection - Inductive Step
17
Activity Selection - Conclusion
18
When Stays Ahead Works Best
19
Exchange vs Stays Ahead
20
Quiz: Choosing a Technique
21
Finding Counterexamples
22
Counterexample - 0/1 Knapsack
23
Counterexample - Better Example
24
Counterexample - The Classic
25
Why Greedy Fails for 0/1 Knapsack
26
How to Find Counterexamples
27
Quiz: Counterexample Thinking
28
Problem - Minimum Waiting Time
29
Minimum Waiting - The Greedy Claim
30
Minimum Waiting - Exchange Proof
31
Minimum Waiting - Algorithm
32
Problem - Tandem Bicycle
33
Tandem Bicycle - Maximize Speed
34
Tandem Bicycle - Minimize Speed
35
Tandem Bicycle - Proof Sketch
36
Problem - Class Photos
37
Class Photos - Greedy Solution
38
Class Photos - Proof
39
Quiz: Class Photos
40
Common Proof Mistakes
41
Practice Strategy
42
Section Recap
Activity Selection
0/43
Interval Problems
0/44
Array Greedy Problems
0/41
Greedy Optimization
0/38
Advanced Greedy
0/37
Practice Problems
0/35
2.1
Intro
2 minutes
100%
Tasks
Read Unit