Algorithms, Part I

Overview

Part I of the classic Sedgewick and Wayne algorithms sequence, covering the data structures and algorithmic thinking every serious programmer eventually needs: elementary data structures, sorting, and searching, all worked through in Java. It's rigorous but application-first, pairing theory with performance analysis rather than treating Big-O as an abstract exercise.

Who it's for

Pitched at an intermediate level, it assumes you can already write code and want to reason properly about why it's fast or slow. With over 1.4 million students having taken it, it's one of the most enrolled computer-science courses anywhere online — a strong signal of how well it holds up as a foundation.

Key skills

• Core data structures and their trade-offs
• Sorting and searching algorithms
• Java programming and memory-aware performance testing

A dependable pick before tackling graph and string algorithms in Part II.