Robert Sedgewick and Philippe Flajolet’s An Introduction to the Analysis of Algorithms is a comprehensive book on the main techniques and models used in the mathematical analyses of various algorithms. The book comprises of Recurrence Relations, Generating Functions, Trees, Asymptotic Approximations, Strings and Tries, Permutations and other such topics. It also consists of various sorting and searching techniques and string processing algorithms, along with discrete mathematics, elementary real analysis and combinatorics part of different analysis methods. The book is essential for Computer Science and Information Science engineering students.
About the Authors
Robert Sedgewick is the Professor of Computer Science department at the Princeton University and was also the founding Chairman of the same. He has completed his PhD at the Stanford University. He is also the Director of Adobe Systems. Robert has previously worked in Xerox PARC, INRIA and IDA. He has also authored and co-authored many books like Algorithms in C: Fundamentals, Data Structures, Sorting, Searching, Parts 1-4, Analytic Combinatorics, Bundle Of Algorithms In C++, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, And Graph Algorithms, and Introduction To Programming In Java: An Interdisciplinary Approach and Algorithms in C among other works.
Philippe Flajolet was a French Computer Scientist. He completed his PhD in Computer Science at the University Paris Diderot. His main interest of research area was in general methods for analysing the algorithms’ computational complexities. Philippe introduced the theory of Analytic Combinatorics. He has authored and co-authored books like Analytic Combinatorics and Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities (Trends in Mathematics) among other works.