Rent $41.70
- List Price: $89.99
- Save: $48.29 (54%)
- FREE return shipping at the end of the semester.
- Access codes and supplements are not guaranteed with rentals.
Rented from RentU
Fulfilled by Amazon
Fulfillment by Amazon (FBA) is a service we offer sellers that lets them store their products in Amazon's fulfillment centers, and we directly pack, ship, and provide customer service for these products. Something we hope you'll especially enjoy: FBA items qualify for FREE Shipping and .
If you're a seller, Fulfillment by Amazon can help you grow your business. Learn more about the program.
Buy new:
$72.49$72.49
FREE delivery:
Tuesday, Feb 14
Ships from: Amazon.com Sold by: Amazon.com
Buy used: $62.93
Other Sellers on Amazon
+ $3.99 shipping
48% positive over last 12 months
& FREE Shipping
91% positive over last 12 months
Usually ships within 3 to 4 days.
& FREE Shipping
92% positive over last 12 months

Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required. Learn more
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.


Follow the Authors
OK
Algorithms (4th Edition) 4th Edition
Price | New from | Used from |
- eTextbook
$53.99 Read with Our Free App - Hardcover
$41.70 - $72.49
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.
- ISBN-10032157351X
- ISBN-13978-0321573513
- Edition4th
- PublisherAddison-Wesley Professional
- Publication dateMarch 24, 2011
- LanguageEnglish
- Dimensions7.7 x 1.4 x 9.3 inches
- Print length976 pages
![]() |
Frequently bought together
- +
- +
More items to explore
- The primary purpose of static methods is to implement functions; the primary purpose of non-static (instance) methods is to implement data-type operations.Highlighted by 244 Kindle readers
- An abstract data type (ADT) is a data type whose representation is hidden from the client.Highlighted by 225 Kindle readers
- Indeed, when the number of inversions is low, insertion sort is likely to be faster than any sorting method that we consider in this chapter.Highlighted by 181 Kindle readers
From the Publisher
Distinctive Features
|
|
|
|
---|---|---|---|
AlgorithmsDescriptions 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 typesSedgewick and Wayne use a modern programming style based on data abstraction, so that algorithms and their data structures are encapsulated together. |
ApplicationsEach 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 approachThe 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.
Editorial Reviews
About the Author
Robert Sedgewick has been a Professor of Computer Science at Princeton University since 1985, where he was the founding Chairman of the Department of Computer Science. He has held visiting research positions at Xerox PARC, Institute for Defense Analyses, and INRIA, and is member of the board of directors of Adobe Systems. Professor Sedgewick’s research interests include analytic combinatorics, design and analysis of data structures and algorithms, and program visualization. His landmark book, Algorithms, now in its fourth edition, has appeared in numerous versions and languages over the past thirty years. In addition, with Kevin Wayne, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).
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. With Robert Sedgewick, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).
Product details
- Publisher : Addison-Wesley Professional; 4th edition (March 24, 2011)
- Language : English
- Hardcover : 976 pages
- ISBN-10 : 032157351X
- ISBN-13 : 978-0321573513
- Item Weight : 3.16 pounds
- Dimensions : 7.7 x 1.4 x 9.3 inches
- Best Sellers Rank: #73,193 in Books (See Top 100 in Books)
- Customer Reviews:
Videos
Videos for this product
2:57
Click to play video
Algorithms, 4th Edition
Merchant Video
About the authors
Robert Sedgewick (born December 20, 1946) is a computer science professor at Princeton University and a member of the board of directors of Adobe Systems.
Sedgewick completed his Ph.D. in 1975 under the supervision of Donald Knuth at Stanford. His thesis was about the quicksort algorithm. In 1975–85 he served on the faculty of Brown University.
Sedgewick was the founding Chairman (1985) of the Department of Computer Science at Princeton University and is currently still a Professor of Computer Science at Princeton. He was a visiting researcher at Xerox PARC, Institute for Defense Analyses and INRIA.
In 1997 Robert Sedgewick was inducted as a Fellow of the Association for Computing Machinery for his seminal work in the mathematical analysis of algorithms and pioneering research in algorithm animation.
Robert Sedgewick is the author of a well-known book series Algorithms, published by Addison-Wesley. The first edition of the book was published in 1983 and contained code in Pascal. Subsequent editions used C, C++, Modula-3, and Java.
With Philippe Flajolet he wrote several books and preprints which promoted analytic combinatorics, a discipline which relies on the use of generating functions and complex analysis in order to enumerate combinatorial structures, and to study their asymptotic properties. As explained by Knuth in The Art of Computer Programming, this is the key to perform average case analysis of algorithms.
He teaches four open online courses on the online learning platform Coursera, namely Algorithms Part I and Part II, Analysis of Algorithms and Analytic Combinatorics.
Bio from Wikipedia, the free encyclopedia.
Discover more of the author’s books, see similar authors, read author blogs and more
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on Amazon
Reviewed in the United States on May 29, 2020
-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
But what really impressed me was the code. This book shows the fundamental data structures and algorithms in just a few lines of beautiful and well-thought code. Sure, any nit-picker may find quibbles, but most choices are understandable from a didactic and printing perspective. This code is so much better than any in the old C++ book. The authors preferred clarity, yet the code is still concise. The authors are clear about feature creep, and limit their code to what is needed and no more, though some extensions are part of the exercises. I am reminded of the Einstein paraphrase "As simple as possible, but no simpler".
More complex data structures and algorithms need multiple code boxes, which are all explained in detail, with the box appearing close to the explanation. Some readers may take issue with the density of information in examples, but I find it advantageous to have all information close-by rather than spread out. I prefer to pore over their dense examples than having to flip pages.
The content itself is great, but I am deducting a point because of the print quality of the textbook. For some reason, a lot of the pages in my copy look grayer than they should. I'm not sure if it's a book formatting issue where the font color was set to gray accidentally or if it is a publisher issue, but for some pages the black text just doesn't appear as crisp and dark. I attached some pictures but my phone seems to color correct things and the difference in the photos doesn't seem big. In person, the variation in the black text throughout the book is definitely noticeable, though.

Reviewed in the United States 🇺🇸 on May 29, 2020
The content itself is great, but I am deducting a point because of the print quality of the textbook. For some reason, a lot of the pages in my copy look grayer than they should. I'm not sure if it's a book formatting issue where the font color was set to gray accidentally or if it is a publisher issue, but for some pages the black text just doesn't appear as crisp and dark. I attached some pictures but my phone seems to color correct things and the difference in the photos doesn't seem big. In person, the variation in the black text throughout the book is definitely noticeable, though.


I would heartily recommend this book to everyone. For the student to learn the basic set of algorithms, for the entry and mid level software engineers (or programmers) to inspire new ideas from a solid foundation, and for us veterans as a reminder to a solid way for development of our own algorithms.
It is well written, and easy to understand (even for the interns I've had read through it). The examples are developed around Java, and so the book starts with a section on Java and basic programming techniques. It contains a large set of the basic algorithms that are frequently necessary on a day to day basis, but also shows HOW and WHY they were developed. It also provides a section on several advanced topics, again with an eye to the HOWs and WHYs. All along the way, there are references to "Good" development foundations, and reminders the development philosophies.
Top reviews from other countries


Very very well formatted that will actually help you to visualize the process/steps of a given algorithm. Coverage was good and you can really get the classic algorithms.



I have even found a mistake in heapsort implementation, it will work for odd number of inputs, but would fail for even number of inputs.
Many problems are ambiguous and not clearly stated. As an example, problem 1.4.19 clearly asks for local INTERNAL minimum of a 2D matrix, but one may not exist, and the minimum maybe on the boundary.
Another problem, 2.4.23, deals with finding optimal value t for t-ary heap, that minimizes the coefficient of N*lgN. However, it is very confusing to understand what author wants, since the height of the t-ary heap in a logarithm of N on base t. lgN that is in the question is likely base-2 logarithm. But in other books log is used for base 2 logarithm, while lg is used for base-10 logarithms. The conventions are never defined in this book.
This book also very big but cannot be used as a reference, you need to read the whole chapter, with multiple data structures, in order to understand one specific algorithm or data structure. It is because of the Java code, instead of pseudocode, implementation. The author references all his previous methods along the way.
This book is used as a textbook in engineering university course and these ambiguous problems are part of home assignments and tests.
I would also mention that the book website has a lot of good material for free that I am recommending.
As for Data Structures and algorithms I would recommend book of Thomas Cornman and books of Tim Roughgarden.