T.H.Cormen, C.E.Leiserson, R.L.Rivest, "Introduction to Algorithms" (MIT Press, 1990 etc.)
Перевод на русский "Алгоритмы. Построение и анализ":
By far the most widely used university/college level texbook on design and implementation of alorithms. Easy to read and of very good quality in general. A "must read".
See table of contents
А. Шень, "ПРОГРАММИРОВАНИЕ: Алгоритмы, Теоремы, Задачи":
Нетолстая, но весьма полезная книжка. Есть на ftp://ftp.mccme.ru/users/shen/progbook/
В Windows ps-файлы смотрятся программой GSView.
В.Беров, А. Лапунов, В. Матюхин, "Особенности национальных задач по программированию"
R.Sedgewick, "Algorithms" (2nd ed.: Addison-Wesley, 1988):
This was the main reference before CLR came out. Perhaps it pays more attention to the details of implemetation, therefore sometimes is slower to read than CLR. Still rather useful.
A.Aho, J.Hopcroft, J.Ullman, "The Design and Analysis of Computer Algorithms" (Addison-Wesley, 1976):
An old book, a bit more theoretical than the previous two. But sometimes it covers more advanced areas, so it is not only of historical interest.
D.E.Knuth, "The Art of Computer Programming" vv. 1,2,3 (Addison-Wesley, 1975 etc.):
A rather special book. Everyone should look it through and be aware of what it is like, but I don't recommend it as a reading for a beginner. It is impossible not to mention it, though.
N.Cristofides, "Graph Theory - an Algorithmic Approach" (Academic Press, 1975):
This book is completely different. It covers only graph algorithms and doesn't care much about implementation details. I note it here just to show how a less general-purpose book on algoritms may look. It is somewhat old-fashioned, but contains enough material to be of use.
- 25 Mar 2004