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. Salient 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

More Details about An Introduction to the Analysis of Algorithms

General Information  
Author(s)Robert Sedgewick and Philippe Flajolet
Edition1st Edition
Publish YearJanuary 2009