SSourav Saha
HomeExperienceSoftware DesignSystem DesignLearningBooksToolsContact
SSourav Saha

Building scalable backend systems, distributed infrastructure, and cloud-native applications.

Navigation

  • Home
  • Experience
  • Software Design
  • System Design
  • Learning

More

  • Books
  • Tools
  • Contact

Connect

  • LinkedIn
  • Email

© 2026 Sourav Saha. All rights reserved.

Built with using Next.js

BooksIntroduction to Algorithms (CLRS)
Algorithmscompleted

Introduction to Algorithms (CLRS)

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein

5/5

The algorithms bible — essential reference for competitive programming, GATE preparation, and algorithmic problem solving.

Read on September 1, 2018

Favorite Quotes

“Before there were computers, there were algorithms.”
“An algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output.”

Why I Read This

This was the foundational text for my computer science education and GATE preparation. As a former TA for Algorithms-1 at IIT Kharagpur and achieving AIR 116 in GATE, I spent countless hours dissecting the proofs and pseudo-code in this book.

Key Takeaways

  1. Rigor in Analysis: Taught me how to mathematically prove the asymptotic complexity of algorithms (Big O, Theta, Omega).
  2. Dynamic Programming & Greedy Algorithms: Mastered the distinction between optimal substructure and overlapping subproblems.
  3. Graph Algorithms: Deep understanding of shortest paths, minimum spanning trees, and network flows which are crucial for distributed routing systems.
  4. Data Structures: Going beyond standard libraries to understand the mechanics of B-Trees, Red-Black Trees, and Disjoint Sets.
Back to all books