For Lecture 9, Gusfield starts discussion of greedy algorithms: Picking the largest number of non-overlapping intervals on a line.

Greedy algorithms: Picking largest set of non-overlapping intervals

The purpose of this undergraduate course is to introduce fundamental techniques and viewpoints for the design and the analysis of efficient computer algorithms, and to study important specific algorithms. The course relies heavily on mathematics and mathematical thinking in two ways: first as a way of proving properties about particular algorithms such as termination, and correctness; and second, as a way of establishing bounds on the worst case (or average case) use of some resource, usually time, by a specific algorithm. The course covers some randomized algorithms as well as deterministic algorithms.

Share Greedy algorithms: Picking largest set of non-overlapping intervals

Sign up to save your podcasts

Greedy algorithms: Picking largest set of non-overlapping intervals

Greedy algorithms: Picking largest set of non-overlapping intervals