Methods in Algorithmic Analysis

Focusing on the analysis of algorithms, this book presents a comprehensive treatment of the mathematics used to analyze computer algorithms. It provides information on the theory of the topic by including many algorithms and code fragments with detailed analysis. Unlike similar books, this one contains material on enumeration with generating functions, shuffle products, combinatorics of strings, counting in regular languages, and asymptotics from recurrences. The text incorporates the use of C++ throughout and includes many examples and exercises of varying levels of difficulty. A solutions manual is available for qualifying instructors.