Fundamental Algorithms | CS 473/573 | University of Illinois, Urbana-Champaign

Comprehensive course covering recursion, randomization, amortization, graph algorithms, network flows, and hardness. Authored by renowned expert Prof. Jeff Erickson.

Introduction

Algorithms class covering recursion, randomization, amortization, graph algorithms, network flows and hardness. The lecture notes by Prof. Erikson are comprehensive enough to be a book by themselves.

Highlights

• Comprehensive lecture notes covering a wide range of fundamental algorithms
• Authored by Professor Jeff Erickson, a renowned expert in algorithms
• Freely available in electronic format, with an affordable paperback edition

Recommendation

Highly recommended for students interested in a thorough understanding of fundamental algorithms and their applications. The course materials provide an excellent resource for both self-study and classroom learning.