Analysis of Algorithms: 9-part Lecture

This bundle THE PRINT Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field. Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematics and computer science, integrating discrete mathematics, elementary real analysis, combinatorics, algorithms, and data structures. They emphasize the mathematics needed to support scientific studies that can serve as the basis for predicting algorithm performance and for comparing different algorithms on the basis of performance. THE VIDEO LECTURE There are 9 lecture videos that will be streamed on the Informit.com site; each lecture is approximately 80 minutes in length and focuses on a specific topic related to the Introduction to the Analysis of Algorithms book. Taken together, these lectures form an introduction to the analysis of algorithms, including analytic combinatorics. Basic coverage of recurrences, generating functions, and asymptotics leads to an introduction to labelled and unlabelled combinatorial classes. Then we survey trees, permutations, strings and tries, and words and mappings, with applications drawn from the study of widely-used algorithms. Each lecture corresponds to a chapter in the book, so there is a suggested reading corresponding to each lecture video.