I have been using this book as a second reference in my Algorithm
Engineering class during the whole semester. I found it extremely useful for its nice structure, content and diversity of subjects treated, especially the ones in computational geometry such as Geometric Sweeping and Voronoi diagrams, for instance. I believe this book should be useful to any student taking algorithms class for its structureness, clearness, and completeness.

Скачать книгу бесплатно (djvu, 9.12 Mb)

---

Читать «Algorithms: Design Techniques and Analysis (Lecture Notes Series on Computing)»