Price: $89.99 - $77.75
(as of Dec 28, 2024 18:31:00 UTC – Details)
This fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing–including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.
The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts.
The companion web site, algs4.cs.princeton.edu, contains
An online synopsis Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Links to related material
The MOOC related to this book is accessible via the “Online Course” link at algs4.cs.princeton.edu. The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants.
Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience.
From the Publisher
Distinctive Features
Algorithms
Descriptions of algorithms are based on complete implementations and on a discussion of the operations of these programs on a consistent set of examples. Instead of presenting pseudo-code, Sedgewick and Wayne work with real code, so that the programs can quickly be put to practical use. Programs are written in Java, but in a style such that most of the code can be reused to develop implementations in other modern programming languages.
Data types
Sedgewick and Wayne use a modern programming style based on data abstraction, so that algorithms and their data structures are encapsulated together.
Applications
Each chapter has a detailed description of applications where the algorithms described play a critical role. These range from applications in physics and molecular biology, to engineering computers and systems, to familiar tasks such as data compression and searching on the web.
A scientific approach
The emphasizes developing mathematical models for describing the performance of algorithms, using the models to develop hypotheses about performance, and then testing the hypotheses by running the algorithms in realistic contexts.
Breadth of coverage
Segewick and Wayne’s primary goal is to introduce the most important algorithms in use today to as wide an audience as possible. These algorithms are generally ingenious creations that, remarkably, can each be expressed in just a dozen or two lines of code. As a group, they represent problem-solving power of amazing scope. They have enabled the construction of computational artifacts, the solution of scientific problems, and the development of commercial applications that would not have been feasible without them.
They cover basic abstract data types, sorting algorithms, searching algorithms, graph processing, and string processing. They keep the material in algorithmic context, describing data structures, algorithm design paradigms, reduction, and problem-solving models. They cover classic methods that have been taught since the 1960s and new methods that have been invented in recent years.
Publisher : Addison-Wesley Professional; 4th edition (March 24, 2011)
Language : English
Hardcover : 976 pages
ISBN-10 : 032157351X
ISBN-13 : 978-0321573513
Item Weight : 3.02 pounds
Dimensions : 7.7 x 1.4 x 9.3 inches
Customers say
Customers find this book helpful for learning algorithms in a clear and understandable way. They appreciate the concise explanations and working code examples. The material is good quality, with no defects. Customers consider it a good value for the money and say it’s worth every penny. They find the exercises interesting and provided at the end of each chapter. However, some readers feel the reading style is boring and not suitable for self-study.
AI-generated from the text of customer reviews
