Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Loading your book clubs
There was a problem loading your book clubs. Please try again.
Not in a club? Learn more
Join or create book clubs
Choose books together
Track your books
Bring your club to Amazon Book Clubs, start a new book club and invite your friends to join, or find a club that’s right for you for free.
Something went wrong. Please try your request again later.
Hard Rock apparel
Outerwear, tees, and accessories. Discover the rock shop.
Customers who read this book also read
Page 1 of 1 Start overPage 1 of 1
Popular Highlights in this book
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 259 Kindle readers- An abstract data type (ADT) is a data type whose representation is hidden from the client.Highlighted by 245 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 187 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.
Reviews with images
Great content. Printing could be better
I started reading "Algorithms" after Sedgewick and Wayne' s "Computer Science: An Interdisciplinary Approach," which I think is a great place to start for those who are new to (object-oriented) programming. This book, Algorithms, (and the Coursera course or the COS 226 at Princeton) builds your knowledge further by fleshing out the theory behind the data structures. I only made it through the first 3 chapters so far, but I think I became better at writing cleaner, concise, and correct code by reading this book and doing some coding assignments (of the Coursera course, which is based on this book and/or the course COS 226 at Princeton which uses this book). I like this book and the exercises because they provide a good mix of theory and practice. I feel like this book is great preparation for interviews, as well as for further study from books which use pseudo-code.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.
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
Reviewed in the United States on March 8, 2024
Reviewed in the United States on November 20, 2014
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.
Great content. Printing could be better
Reviewed in the United States on May 29, 2020
I started reading "Algorithms" after Sedgewick and Wayne' s "Computer Science: An Interdisciplinary Approach," which I think is a great place to start for those who are new to (object-oriented) programming. This book, Algorithms, (and the Coursera course or the COS 226 at Princeton) builds your knowledge further by fleshing out the theory behind the data structures. I only made it through the first 3 chapters so far, but I think I became better at writing cleaner, concise, and correct code by reading this book and doing some coding assignments (of the Coursera course, which is based on this book and/or the course COS 226 at Princeton which uses this book). I like this book and the exercises because they provide a good mix of theory and practice. I feel like this book is great preparation for interviews, as well as for further study from books which use pseudo-code.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.
Images in this review
Top reviews from other countries
Noharicot
Reçu en bon état, dans les délais
Reviewed in Belgium on October 30, 2023Juan Carlos
Libro interesante para aprender algoritmos
Reviewed in Spain on January 10, 2023