Introduction to the Analysis of Algorithms, An, 2nd edition

Published by Pearson (January 18, 2013) © 2013

  • Robert Sedgewick Princeton University
  • Philippe Flajolet

eTextbook

$76.99

  • Available for purchase from all major ebook resellers, including InformIT.com.
  • To request a review copy, click on the "Request a Review Copy" button.
$63.99

  • A print text (hardcover or paperback) 
  • Free shipping
  • Also available for purchase as an ebook from all major ebook resellers, including InformIT.com

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. Authors Robert Sedgewick and the late Philippe Flajolet 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. Improvements and additions in this new edition include upgraded figures and code, an all-new chapter introducing analytic combinatorics, and simplified derivations via analytic combinatorics throughout. The book’s thorough, self-contained coverage will help readers appreciate the field’s challenges and prepare them for advanced study.

The author makes instructor resources available at http://aofa.cs.princeton.edu/home/.

• All the figures and code have been upgraded
• Much of the math is now written in a newer style• A new Chap 5, on trees
  • Chapter 1: Analysis of Algorithms
  • Chapter 2: Recurrence Relations
  • Chapter 3: Generating Functions
  • Chapter 4: Asymptotic Approximations
  • Chapter 5: Analytic Combinatorics
  • Chapter 6: Trees
  • Chapter 7: Permutations
  • Chapter 8: Strings and Tries
  • Chapter 9: Words and Mappings
  • List of Theorems
  • List of Tables
  • List of Figures
  • Index

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University, where was founding chair of the computer science department and has been a member of the faculty since 1985. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He is the coauthor of the landmark introductory book, Algorithms, Fourth Edition. Professor Sedgewick earned his Ph.D from Stanford University under Donald E. Knuth.

The late Philippe Flajolet was a Senior Research Director at INRIA, Rocquencourt, where he created and led the ALGO research group. He is celebrated for having opened new lines of research in the analysis of algorithms; having systematized and developed powerful new methods in the field of analytic combinatorics; having solved numerous difficult, open problems; and having lectured on the analysis of algorithms all over the world. Dr. Flajolet was a member of the French Academy of Sciences.

Need help? Get in touch

Video
Play
Privacy and cookies
By watching, you agree Pearson can share your viewership data for marketing and analytics for one year, revocable by deleting your cookies.

Pearson eTextbook: What’s on the inside just might surprise you

They say you can’t judge a book by its cover. It’s the same with your students. Meet each one right where they are with an engaging, interactive, personalized learning experience that goes beyond the textbook to fit any schedule, any budget, and any lifestyle.