This study book on computer algorithms was written by Robert Sedgewick and Kevin Wayne, professors of Computer Science at Princeton University. It provides a thorough introduction to fifty essential algorithms that are of interest to anyone in science, engineering, mathematics, and the humanities with an interest in computational applications. The book covers data structures and algorithms in a practical way, so readers can implement and apply them in a variety of programming environments.
Contents
The thematic structure includes:
- Fundamentals: basic programming models, data abstraction, bags, queues and stacks, analysis of algorithms
- Sorting: elementary sorts, mergesort, quicksort, priority queues and applications
- Graphs: undirected and directed graphs, minimum spanning trees, shortest paths
- Strings: string sorting, tries, substring search, regular expressions, data compression
These carefully selected algorithms illustrate the power of problem-solving approaches in computer science and make complex problems manageable through clear and compact code.
Product specifications
- Author: Robert Sedgewick
- Publisher: Pearson Education (US)
- Imprint: Addison-Wesley Educational Publishers Inc
- Publication date: 2011-03-31
- Number of pages: 976
- ISBN: 9780321573513
- Theme: Algorithms and data structures
- BISAC: COMPUTERS / Programming / Algorithms
About the authors
Robert Sedgewick has been a professor of Computer Science at Princeton University since 1985 and the founder of the department. His research focuses on analytic combinatorics and data structures. With Kevin Wayne, he has written several standard works in the field of algorithms and programming.
Kevin Wayne is the Phillip Y. Goldman Senior Lecturer in Computer Science at Princeton and co-author of these authoritative study books on computer algorithms.