Grokking Algorithms

Grokking Algorithms

An Illustrated Guide for Programmers and Other Curious People

Aditya Bhargava

Planned
Algorithms
Data Structures
Computer Science

About the Book

A visual, beginner-friendly walk through core algorithms and data structures — sorting, searching, graphs, dynamic programming — using illustrations and plain-language explanations instead of heavy math or dense pseudocode.

Key Concepts

No concepts extracted yet.

Chapters

  1. 01

    Introduction to Algorithms

  2. 02

    Selection Sort

  3. 03

    Recursion

  4. 04

    Quicksort

  5. 05

    Hash Tables

  6. 06

    Breadth-First Search

  7. 07

    Trees

  8. 08

    Balanced Trees

  9. 09

    Dijkstra's Algorithm

  10. 10

    Greedy Algorithms

  11. 11

    Dynamic Programming

  12. 12

    K-Nearest Neighbours

  13. 13

    Where to Go Next

Applied in Practice

No practical applications connected yet.

Youssef El Sayed

Building scalable, high-performance web and mobile applications with clean, efficient code.

Connect

Copyright © 2026. All rights reserved.

Built with Next.js & Tailwind CSS