Introduction to Algorithms

Introduction to Algorithms by Thomas H. Cormen (CLRS):

It’s a classic textbook that teaches how to design and analyze computer algorithms. The book explains step by step how algorithms work, how to measure their efficiency, and when to use them. It covers basics like sorting and searching, data structures, graphs, dynamic programming, greedy methods, and advanced topics like NP-completeness. Written with clear explanations and pseudocode, it’s widely used by students, teachers, and professionals to understand the foundations of computer science.