This unit covers several greedy algorithms and their basic characteristics
- Coin change
- Interval scheduling
- Load balancing
Complementary notes can be found in section 3.4 of the book Competitive Programming 3.
- Unit 1: Complexity
- UVa 11900 - Boiled Eggs
- UVa 11389 - The Bus Driver Problem
- UVa 11157 - Dynamic Frog
- UVa 10382 - Watering Grass
- UVa 11264 - Coin Collector
- UVa 10714 - Ants
- UVa 11100 - The Trip, 2007
- UVa 10718 - Bit Masks