Skip to content

Map Search My cards Pricing

Make it comfy

Lesson style

Quick mode shows the key picture, a summary and the practice. Good for a refresher.

Theme

Font

Both fonts are designed to be easy to read. Some readers with dyslexia prefer Lexend.

Text size

Spacing

Animations

Map Search My cards Pricing

Map › Level 4: Clever Recipes

F18

Algorithms 2

“Puzzles even computers find hard”

Lessons

Being drawn right now ✏️

Lessons for this course are being written. Everything in Foundations will be free, forever.

Back to the map

What you’ll learn

network flow, linear programming, NP-completeness, approximation, randomized, amortized, string and parallel algorithms

🔨 Boss level project

Scheduler using max-flow + a SAT solver

📚 Recommended books

CLRS
Erickson, Algorithms (free)

Optional. Every lesson here stands on its own.

← F17 Algorithms 1 F19 Theory of Computation →

Crayon CS

Everything a CS degree teaches, explained like you’re 5.

How we built the curriculum Terms Privacy Accessibility

Crayon CS is an independent learning site. It is not an accredited institution, does not award degrees, and is not affiliated with or endorsed by any university.