Algorithms, Part I
Is this course right for you?
Sedgewick and Wayne aren't interested in shortcuts. They take you through sorting, searching, graphs and the data structures beneath them with a rigour that makes you understand why each works, not just how to call it, and the Java assignments have you build them yourself.
There's no certificate — Princeton doesn't offer one here — so you take this purely for what it does to your thinking, which is considerable. It's also genuinely hard, and paced for people already comfortable coding.
If what you really want is interview drilling, a dedicated coding-interview course will serve you better; if Java is new, learn that first. Algorithms themselves don't age, so none of this has gone stale (as of 2026).
Compare alternatives for Algorithms, Part I
- Price
- FreeFree — Princeton issues no certificate
- Duration
- —
- Level
- Intermediate
- Certificate
- Price
- FreeAudit free · Certificate available
- Duration
- —
- Level
- Intermediate
- Certificate
- Specialization
- Price
- PaidSubscription-based, free to audit
- Duration
- 40 hrs
- Level
- Intermediate
- Certificate
- Course Certificate
- Price
- PaidPaid, frequently discounted
- Duration
- 41 hrs
- Level
- Beginner
- Certificate
- Course Certificate
About this course
Algorithms, Part I is a standout algorithms course online — and one of the hardest. From Princeton's Robert Sedgewick and Kevin Wayne, it covers the essential data structures and algorithms every serious programmer should know: union-find, stacks and queues, sorting, priority queues, binary search trees, and balanced trees, all with rigorous analysis and challenging Java programming assignments.
Instructor
Robert Sedgewick and Kevin Wayne are Princeton computer scientists and authors of the definitive 'Algorithms' textbook. Their course is renowned for its rigour and clarity, and is consistently ranked among the very best on Coursera.