[Latest Update: 2021/02/09]
Notes on Greedy Algorithms
-
SCREENCAST Introducing Greedy Algorithms and
An Algorithm for The Interval Scheduling Problem (MP4)
-
SCREENCAST Proving That The Earliest-Finish-Time-First
Algorithm Works (MP4)
-
Worked Example of The Interval Scheduling Algorithm of Section 4.1 (PDF)
-
Worked Example of The Interval Scheduling Algorithm of Section 4.1 (PowerPoint Download)
-
Discussion about Greedy Algorithms and Details of Interval Scheduling (HTML)
-
SCREENCAST Introducing the Scheduling All Intervals Problem
and Explaining The Algorithm (MP4)
-
SCREENCAST Explaining That The Algorithm
for The Scheduling All Intervals Problem Works
and Showing How to Implement It Efficiently (MP4)
-
Worked Example of The "Schedule All Intervals" Algorithm of Section 4.1 (PDF)
-
Another Worked Example - with Priority Queue - of The "Schedule All Intervals" Algorithm of Section 4.1 (PDF)
-
Sketch of The Proof That The "Schedule All Intervals" Algorithm of Section 4.1
Does Not Exceed d (= depth) Classrooms (PDF)
-
SCREENCAST On The Scheduling to Minimize Lateness Problem (MP4)
-
Lecture Slides for Greedy Algorithms, Part I (PDF)
-
Lecture Slides for Greedy Algorithms, Part II (PDF)
-
SCREENCAST: Shortest Paths & Dijkstra's Algorithm, Part I (MP4)
-
SCREENCAST: Shortest Paths & Dijkstra's Algorithm, Part II (MP4)
-
SCREENCAST: Shortest Paths & Dijkstra's Algorithm, Part III (MP4)
-
SCREENCAST: Shortest Paths & Dijkstra's Algorithm, Part IV (MP4)
-
Worked Example of Dijkstra's Algorithm (Powerpoint Download)
-
Information on Dijkstra's Algorithm
-
SCREENCAST: Minimum Cost Spanning Trees, Part I (MP4)
-
SCREENCAST: Minimum Cost Spanning Trees, Part II (MP4)
-
SCREENCAST: Minimum Cost Spanning Trees, Part III (MP4)
-
SCREENCAST: Minimum Cost Spanning Trees, Part IV (MP4)
-
Information about Minimum Cost Spanning Tree Algorithms
-
Information about Disjoint Set Representation
-
Summary of Information about Efficiency of Some Greedy Algorithms