An Open Guide to Data Structures and Algorithms

Reviewed by Andy Elliot Ricci, Assistant Professor, Bates College on 2/23/26

Comprehensiveness rating: 5 see less

The text covers key data structures, algorithms, and the basics of complexity. In addition to the properties of data structures and algorithms, the authors provide a good amount of theoretical depth related to complexity. The end-of-chapter exercises ask students to build on what they learned in the chapter through implementations or problem solving.

Content Accuracy rating: 5

The book is highly accurate.

Relevance/Longevity rating: 5

The text focuses on concepts and theory around key data structures and algorithms.

Clarity rating: 5

The text is clearly written. The authors do a good job of using clear examples and intuition to build up to technical content. The first chapter is a particularly strong example of the balance between jargon-free intuition building (how can you sort cards?) and highly technical content (formal definition of Big-O). The text makes good use of pseudocode, figures, and mathematical notation.

Consistency rating: 5

The book is highly consistent

Modularity rating: 5

The book is well organized with chapters, learning goals, and sub-sections. Many of the end-of-chapter exercises can be stand-alone assignments.

Organization/Structure/Flow rating: 5

Good organization.

Interface rating: 5

No significant interface issues.

Grammatical Errors rating: 5

No grammatical errors.

Cultural Relevance rating: 5

No cultural insensitivity.