Offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, and computational complexity that is accessible to mainstream computer science students. Unlike the first edition which used Pascal-like pseudocode, this edition presents algorithms using a C++ like pseudocode.

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