Notes on Greedy Algorithms
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)
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)
Lecture Slides for Greedy Algorithms, Part I (PDF)
Lecture Slides for Greedy Algorithms, Part II (PDF)
Worked Example of Dijkstra's Algorithm (Powerpoint Download)
Information on Dijkstra's Algorithm
Information about Disjoint Set Representation
Information about Minimum Cost Spanning Tree Algorithms
Summary of Information about Efficiency of Some Greedy Algorithms