Greedy Algorithms
Make locally optimal choices at each step to arrive at a global solution.
Dijkstra's Algorithm
A greedy shortest-path algorithm: always expand the nearest unvisited node. Works on non-negative edge weights.
Interval Scheduling
Selects the maximum number of non-overlapping intervals.
Huffman Coding
Builds an optimal prefix-free encoding tree based on symbol frequencies.