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

Introduction to Algorithms

There are books on algorithms that are rigorous but not complete and books that cover masses of material but are not rigorous. Introduction to Algorithms combines the attributes of comprehensiveness and comprehensibility. It will be equally useful as a text, a handbook, and a general reference.

Introduction to Algorithms covers both classical material and such modern developments as amortized analysis and parallel algorithms. The mathematical exposition, while rigorous, is carefully detailed so that it will be accessible to all levels of readers. Chapters are organized so that they start with elementary material and progress to more advanced topics.

Each chapter is relatively self-contained and can be used as a unit of study. Algorithms are presented in a pseudocode that can be easily read by anyone familiar with Fortran, C, or Pascal. Numerous pertinent examples, figures, exercises, and casestudy problems emphasize both engineering and mathematical aspects of the subject.

Thomas Cormen is Assistant Professor in the Department of Mathematics and Computer Science at Dartmouth College. Charles Leiserson and Ronald Rivest are Professors in the Department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. Introduction to Algorithms is in the MIT Electrical Engineering and Computer Science series.

Es werden alle wichtigen Algorithmen sehr verständlich erklärt, auch anhand von Grafiken und Pseudocode, und es gibt zu jedem Kapitel Aufgaben. Dadurch kann es sehr gut zum Lernen der Algorithmen benutzt werden. Aber auch als Nachschlagewerk ist dieses Buch durch den sehr ausführlichen Index sehr gut zu gebrauchen. Eben das Standardwerk zu Algorithmen, das in keinem Informatiker-Bücherregal fehlen sollte.

Bewertung:

So bewerte ich:
		besondere Bücher
		sehr gut
		gut
		geht so
		gar nicht mein Fall