• Title: Algorithms, 4th Edition
• Author(s) Robert Sedgewick and Kevin Wayne
• Publisher: Addison-Wesley Professional; 4 edition (March 19, 2011)
• Hardcover: 976 pages
• eBook: HTML and PDF
• Language: English
• ISBN-10: 032157351X
• ISBN-13: 978-0321573513
• Share This:  

Book Description

This is the latest version of Sedgewick's best-selling series, reflecting an indispensable body of knowledge developed over the past several decades.

This textbook surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm that we address by examining its impact on specific applications.

• Robert Sedgewick is William O. Baker Professor of Computer Science at Princeton University and a member of the board of directors of Adobe Systems. In addition, he is the coauthor of the highly acclaimed textbook, Algorithms, 4th Edition and Introduction to Programming in Java: An Interdisciplinary Approach.
• Kevin Wayne is the Phillip Y. Goldman Senior Lecturer in Computer Science at Princeton University, where he has been teaching since 1998. He received a Ph.D. in operations research and industrial engineering from Cornell University. His research interests include the design, analysis, and implementation of algorithms, especially for graphs and discrete optimization.

• Amazon

• Algorithms and Data Structures
• Graph Theory
• Computational and Algorithmic Mathematics
• Computational Complexity
• Discrete Mathematics

• Algorithms, 4th Edition, by Robert Sedgewick and Kevin Wayne
• The Mirror Site (1) - PDF
• The Mirror Site (2) - PDF (GitHub)
• 1983 Edition - Classical - PDF (560 pages)

• Algorithm Design (Jon Kleinberg, et al)

  This book introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications.

• Lecture Notes for the Algorithms (Jeff Erickson)

  This lecture notes uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study.

• Algorithms: Fundamental Techniques (Macneil Shonle, et al)

  The goal of the book is to show you how you can methodically apply different techniques to your own algorithms to make them more efficient. While this book mostly highlights general techniques, some well-known algorithms are also looked at in depth.

• Elementary Algorithms (Xinyu Liu)

  This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures. It teaches you how to think like a programmer - find the practical efficiency algorithms to solve your problems.

• Algorithms and Data Structures (Niklaus Wirth)

  From the inventor of Pascal and Modula-2 comes a new version of Niklaus Wirth's classic work, Algorithms + Data Structure = Programs (PH, l975). It includes new material on sequential structure, searching and priority search trees.

• The Algorithm Design Manual (Steven S. Skiena)

  This book serves as the primary textbook for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms, intended as a manual on algorithm design for both students and computer professionals.

• Introduction to Design Analysis of Algorithms (K. Raghava Rao)

  This book was very useful to easily understand the algorithms. This book is having enough examples on every algorithm. It has written for the sake of students to provide complete knowledge on Algorithms.

• Problem Solving with Algorithms/Data Structures using Python

  This is a textbook about computer science. It is also about Python. However, there is much more. The tools and techniques that you learn here will be applied over and over as you continue your study of computer science.

• The Design of Approximation Algorithms (D. P. Williamson)

  This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization, etc.

• Algorithms for Decision Making (Mykel Kochenderfer, et al)

  This textbook provides a broad introduction to algorithms for decision making under uncertainty, covering the underlying mathematical problem formulations and the algorithms for solving them.

• Clever Algorithms: Nature-Inspired Programming Recipes

  The book describes 45 algorithms from the field of Artificial Intelligence. All algorithm descriptions are complete and consistent to ensure that they are accessible, usable and understandable by a wide audience.

• Planning Algorithms (Steven M. LaValle)

  This is the only book for teaching and referencing of Planning Algorithms in applications including robotics, computational biology, computer graphics, manufacturing, aerospace applications and medicine, etc.

• Parallel Algorithms (Henri Casanova, et al)

  Focusing on algorithms for distributed-memory parallel architectures, the book extracts fundamental ideas and algorithmic principles from the mass of parallel algorithm expertise and practical implementations developed over the last few decades.

• Numerical Algorithms: Computer Vision, Machine Learning, etc.

  This book presents a new approach to numerical analysis for modern computer scientists, covers a wide range of topics - from numerical linear algebra to optimization and differential equations - focusing on real-world motivation and unifying themes.