Some of the existing algorithm manuals deal with their subject matter strictly, but they are incomplete; some others cover a wide range of teaching material, but lack strictness. Introduction to Algorithms combines strictness with completeness in a unique way. 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 a standalone study unit. 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 is kept at a basic level without sacrificing depth or mathematical rigor.
The book is widely used in universities around the world and has established itself as a classic reference for computer science professionals. The second Greek edition (translation of the third American edition) has been revised and updated extensively. It includes two new chapters on van Emde Boas trees and multithreaded algorithms, and significant additions to the chapter on recursive relations (now titled "Divide-and-Conquer"); it also provides better treatment of dynamic programming and greedy algorithms, and introduces a new concept of flow based on edges to the material on flow networks. The new edition also includes many new exercises and additional problems.