An Introduction to the Analysis of Algorithms

by Robert Sedgewick, Philippe Flajolet

This book is a thorough overview of the primary techniques and models used in the mathematical analysis of algorithms. The first half of the book draws upon classical mathematical material from discrete mathematics, elementary real analysis, and combinatorics; the second half discusses properties of discrete structures and covers the analysis of a variety of classical sorting, searching, and string processing algorithms.

Features
Thorough, self-contained coverage for students and professionals in computer science and mathematics
Focus on mathematical techniques of analysis
Basic preparation for the advanced results covered in Knuth's books and the research literature
Classical approaches and results in the analysis of algorithms

Table Of Contents
Analysis of Algorithms.
Recurrence Relations.
Generating Functions.
Asymptotic Approximations.
Trees.
Permutations.
Strings and Tries.
Words and Maps.

Genres: Computer Science, Algorithms, Programming, Mathematics, Software, Reference, Technology

512 pages, Paperback

First published December 10, 1995

Reviews

[Leye Wang · Rating 4 out of 5]

An interesting topic and method in analysis of algorithms. But a lot of typos in the book, some of them even very serious. So make sure to check the errata first before you read a new chapter.