Skip to content

Glossary: Algorithms Beyond the Basics in Rust

Interval scheduling

Choosing the most non-overlapping bookings for one room. The greedy rule is to sort by end time and take each booking that starts at or after the last one chosen ends.

Where the book teaches it

Related terms

IntervalGreedy algorithmSwap argument