Loonie PerksDeals for Canada
BlogSearch
Product guide

Grokking Algorithms, Second Edition

Grokking Algorithms, Second Edition is an illustrated introduction to core programming algorithms and data structures. Its stated coverage includes searching, sorting, graphs, trees, greedy and NP-complete problems, with exercises and Python 3 code samples. The 320-page book is aimed at readers without advanced math or programming skills.

At a glance

  • Covers search, sort, graph, greedy and NP-complete algorithms, alongside data structures including arrays, lists, hash tables, trees and graphs.
  • The second edition adds tree topics such as binary search trees, balanced trees and B-trees, according to the listing.
  • Listing describes over 400 illustrations, chapter exercises and annotated code samples updated to Python 3.
Price
$56.09Save 15%

Reference price: $65.99

Price checked: Nov 18, 2026

View offerAhead of Black FridayExplore the selection

Often bought together

Pros and cons

Pros

  • Broad topic range moves from searching and sorting to trees, dynamic programming and algorithm-performance trade-offs.
  • Illustrations and worked explanations offer an approachable route into abstract concepts.
  • Exercises and code samples provide material for practising as concepts are introduced.

Technical specifications

9 specifications
Book details
Edition2nd
PublisherManning
Publication dateMarch 26 2024
LanguageEnglish
Print length320 pages
ISBN-101633438538
ISBN-13978-1633438538
Dimensions and installation
Weight listed544 g
Dimensions18.73 x 1.78 x 23.5 cm

What to know before buying

  • The listing says no advanced math or programming skills are required, so readers seeking an advanced reference or a full programming course may find its introductory focus limiting.

Who is it for?

A good fit for

  • New programmers looking for an illustrated introduction to common algorithms and data structures.
  • Readers who want chapter exercises and Python 3 code examples alongside explanations.
  • Learners reviewing algorithm topics for programming interviews.

Less suited to

  • Readers looking for a comprehensive advanced algorithms reference or a book focused on a programming language beyond the supplied Python 3 examples.
Grokking Algorithms, Second Edition · photo 2
Additional product photo 2

Customer reviews on Amazon

4.7 / 5 · 285 ratings
  • 5 stars81%81%
  • 4 stars13%13%
  • 3 stars2%2%
  • 2 stars1%1%
  • 1 star3%3%

Customer feedback highlights clear explanations, readability for beginners and non-CS readers, and helpful illustrations. Those impressions fit the listing's illustrated, introductory approach and stated exercises, but do not make it an advanced reference. Opinions on value for money are mixed, so the price may matter to buyers weighing a short introductory guide against their learning needs.

Positive themes

  • Customers praise the explanations and readability for beginners and non-CS readers.
  • Customers describe the illustrations as helpful.

Mixed feedback

  • Customer feedback is divided on whether the book offers good value for money.

Frequently asked questions

What topics does the book cover?

The listing describes searching, sorting, graph algorithms, trees, greedy algorithms, NP-complete problems, dynamic programming and data structures such as hash tables.

Does it include programming exercises and code?

The listing says every chapter includes exercises and code samples, with annotated examples updated to Python 3.

Who is the book intended for?

The listing presents it as an introduction for programmers and curious readers, and says advanced math or programming skills are not required.

What do customers say about its explanations?

Customer feedback describes the concepts as well-explained and the book as readable for beginners and non-CS readers. Opinions on value for money are mixed.

Alternative options

Products with discounts that might interest you

4.0
The Unworthy: A Novel
The Unworthy: A Novel

C$25.99

C$22.10

-15%
-15%
Product details in Markdown