Algorithms & Computing Simplified
New · Computing Simplified is here

No coding. Just thinking.

By Rohith B Vex-Metaex-Amazonex-HubSpot

The big ideas behind algorithms and computing (how machines search, decide, store and run, and how to break hard problems into easy ones), explained for anyone curious. Built on everyday analogies and hand-drawn diagrams, with no code required.

70+ readers, zero refunds

14-day money-back guarantee

Secure checkout

Visa Mastercard PayPal Apple Pay Google Pay

PDF · DRM-free · instant download

Try a live lesson first →

The series

Two books. No code. Just the ideas.

For decades, computer scientists have quietly solved the same problems you face every day: when to stop searching and commit, how to choose under uncertainty, how a machine turns a pile of yes-or-no switches into a working program. These two books hand you those ideas in plain language.

The usual take

Computer science gets taught as code and proofs, walled off behind a programming background most people never have the time to get.

The idea here

Start from how a problem is shaped and how a machine actually works, using everyday analogies (a recipe, a phone book, a nightclub bouncer) and clear, hand-drawn diagrams. No code required.

Breadth, then depth

Algorithms Simplified is how to solve: search, sort, decide, divide and conquer. Computing Simplified is how it all runs: bits, memory, the call stack, the event loop. Read either first; together they are the whole picture.

Algorithms Simplified
148 pages · 4 parts · illustrated

Problem-solving, computation and complexity, data structures, and the classic algorithms, by intuition.

  • Fundamentals of Problem-Solving
  • 1.1What is a “problem”?
  • 1.2Types of real-world problems
  • 1.3Data Structures: the building blocks
  • 1.4Solving problems with the State Space formulation
  • 1.5Navigating Through State Space as Graph Traversal
  • 1.6The structure of problem decomposition
  • 1.7What is a solution?
  • 1.8Conclusion
  • Computation and Complexity
  • 2.1What is an algorithm?
  • 2.2What is a program? (barebones)
  • 2.3What is a process?
  • 2.4What is complexity?
  • 2.5What is a Turing Machine?
  • 2.6Conclusion
  • Fundamental Data Structures and their Algorithms
  • 3.1Introduction
  • 3.2Undirected Graphs
  • 3.3General Directed Graphs
  • 3.4Directed Acyclic Graphs (DAGs)
  • 3.5Linked Lists
  • 3.6Weighted Graphs
  • 3.7Arrays
  • 3.8Dictionaries
  • 3.9Sets
  • 3.10Conclusion
  • From Theory to Practice
  • 4.1Binary Search: Finding Information Quickly
  • 4.2Exponential Growth: Efficient Replication
  • 4.3Optimization Problems: Maximizing or Minimizing
  • 4.4Divide and Conquer: Breaking Down Complex Tasks
  • 4.5Greedy Algorithms: Making the Best Immediate Choice
  • 4.6Sorting: Organizing Information
  • 4.7Dynamic Programming: Minimizing Repeated Work
  • 4.8Topological Sorting: Handling Dependencies
  • 4.9Monte Carlo Method: Using Randomness to Solve Problems
  • 4.10Conclusion
Computing Simplified
322 pages · 6 parts · richly illustrated

What a computer really is: bits, storage, processes, concurrency, networks, and the graph underneath it all.

  • Part I: Computation meets the world
  • 1Your inbox follows you everywhere
  • 2What happens when you type a web address
  • 3How we tell a machine what to do
  • Part II: Ways of seeing
  • 4Finding one in a million
  • 5Everything is a yes or no
  • 6There is no free lunch
  • Part III: The recurring shapes
  • 7Locks that no key can open
  • 8How it learns what you like
  • 9Don’t call us, we’ll call you
  • 10Never do the same work twice
  • Part IV: The shape of everything that runs
  • 11The graph underneath
  • 12Two people, one bank balance
  • Part V: Systems in the wild
  • 13Everything fails
  • 14Sent in an instant
  • 15The fastest route
  • Part VI: Back to the edge
  • 16From a key press to a glowing screen
  • 17The whole picture
A taste

Real pages. Read before you buy.

Actual pages from each book, not a marketing summary. If the approach lands for you, the rest is more of the same.

Algorithms Simplified · 148 pages Chapter 4.9 · Estimating π by throwing pebbles
Sample page 1 of 3 Sample page 2 of 3 Sample page 3 of 3
Open as PDF →
Computing Simplified · 322 pages Chapter 5 · Everything is a yes or no
Sample page 1 of 3 Sample page 2 of 3 Sample page 3 of 3
Open as PDF →
Live demos

Play with the ideas, one from each book.

Pulled straight from the interactive companions: press play, pause, and step through.

Algorithms SimplifiedQuicksort vs Mergesort
Computing SimplifiedThe call stack
The author

I'm Rohith, a software engineer with over a decade building production systems, including four years at Meta on Workplace's billing and monetization, a senior role at HubSpot, and backend services and internal tools at Amazon, across the Warehouse Deals and Textbook Rentals teams. I most recently founded Topolog, where I designed and shipped a typed planning language end to end.

I wrote Algorithms Simplified, and then Computing Simplified, as the books I wish more people had access to: ones that explain the why behind each idea, distil it down, and use a diagram wherever a diagram explains it faster. They are written for anyone curious about how these ideas work (no programming background needed) and double as a genuinely useful refresher for engineers prepping interviews.

The diagrams are hand-made, with thanks to my dad for his help on them.

Rohith B V
Author
Rohith B V
Previously
Meta · Amazon · HubSpot
Studied
IIIT Hyderabad · B.Tech CSE
Books
Algorithms & Computing Simplified
Get it

One book, the other, or the whole shelf.

Each book comes with its interactive companion: the demos above, downloadable and yours to tinker with offline.

Algorithms Simplified

Search, sort, decide

How to search, sort, choose under uncertainty, and break hard problems into easy ones.

  • The full Algorithms Simplified book
  • Interactive companion: 14 live demos
  • DRM-free PDF, yours on any device
£29.99Book + interactive companion
Get the bundle Just the book · £19.99
Best value · most popular
The complete set

Both books, both companions

Algorithms and computing together: breadth and depth, the whole picture, at the best price.

  • Algorithms Simplified + Computing Simplified
  • Both interactive companions: 26 live demos in all
  • DRM-free PDFs, yours on any device
Both bundles separately £69.98 · save £9.99
£59.99Both books + both companions
Get the collection Just the two books · £39.99
New
Computing Simplified

How it all works

How machines store, run and coordinate: bits, the call stack, the event loop, and more.

  • The full Computing Simplified book
  • Interactive companion: 12 live demos
  • DRM-free PDF, yours on any device
£39.99Book + interactive companion
Get the bundle Just the book · £29.99

14-day money-back guarantee

Secure checkout · instant download

Visa Mastercard PayPal Apple Pay Google Pay
Questions

Before you buy

Do I need to know how to code?

No. There's no programming or advanced maths required. It's built on everyday analogies and hand-drawn diagrams, written for anyone curious about how these ideas work.

What format is it, and what can I read it on?

A DRM-free PDF. Read it on your phone, tablet, computer or e-reader, and it's yours to keep forever.

How do I get it after I pay?

Instantly. Checkout is handled by Lemon Squeezy, and your download link is shown right after payment and emailed to you.

What's in the interactive companion?

Each book has its own: downloadable HTML animations you open offline and play, pause and step through. Algorithms covers sorting, binary search, dynamic programming and graph traversal; Computing covers bits, the call stack, the event loop, concurrency and more.

Which book should I start with?

Either. Algorithms Simplified is about how to solve problems; Computing Simplified is about how a machine actually works. They stand alone, and the collection bundles both at the best price.

Can I get a refund?

Yes. If the book isn't for you, email rohith@rohith.co.uk within 14 days of your purchase for a full refund, no hard feelings.

Who is it for?

Anyone curious about the ideas behind algorithms, no background needed. It also works as a sharp refresher if you're an engineer prepping interviews.

Ready to see the whole field differently?

Two books, no code, just the ideas. Start building real intuition today, in algorithms, in computing, or in both.

70+ readers, zero refunds

14-day money-back guarantee

Secure checkout

Visa Mastercard PayPal Apple Pay Google Pay