Some existing algorithm textbooks deal with their subject rigorously, but they are incomplete; others cover a wide range of teaching material but lack rigor. Introduction to Algorithms uniquely combines rigor with completeness.

The book covers a wide range of algorithms in depth while keeping their analysis and design accessible to readers at all levels. Each chapter is relatively self-contained and can be used as an independent unit of study. The algorithms are described in natural language and in a pseudocode designed to be understandable by anyone with even minimal programming experience.

The explanation of their operation remains at a basic level without sacrificing depth or mathematical rigor. The book is widely used in universities around the world and has become a classic reference source for computer science professionals.

The second Greek edition (translation of the third American edition) has been thoroughly revised and updated. It includes two new chapters on van Emde Boas trees and multicore algorithms, as well as significant additions to the chapter on recursive relations (which is now titled “Divide-and-Conquer”); it also better discusses dynamic programming and greedy algorithms, and introduces a new edge-based flow concept in the material on flow networks.

This new edition also includes many new exercises and additional problems.