An Introduction to the Analysis of Algorithms, 2nd Edition
โ Scribed by Robert Sedgewick, Philippe Flajolet
- Publisher
- Addison-Wesley
- Year
- 2013
- Tongue
- English
- Leaves
- 593
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
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, 2ond Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field. Techniques covered in the first half of the book include recurrences, generating functions, asymptotics, and analytic combinatorics. Structures studied in the second half of the book include permutations, trees, strings, tries, and mappings.
๐ SIMILAR VOLUMES
This Second Edition of a standard numerical analysis text retains organization of the original edition, but all sections have been revised, some extensively, and bibliographies have been updated. New topics covered include optimization, trigonometric interpolation and the fast Fourier transform, num
This book is REALLY for coursework : someone who is going to sit down and read and work thru this book sequentially, not randomly like a reference book. Other than that caveat it does what it promises ably but be aware that it is MATHS heavy and REQUIRES the programme work.
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