Programming Books C Java PHP Python Learn more Browse Programming Books
Algorithms (4th Edition) and over one million other books are available for Amazon Kindle. Learn more

Sorry, this item is not available in
Image not available for
Color:
Image not available

To view this video download Flash Player

 


or
Sign in to turn on 1-Click ordering
Sell Us Your Item
For a $42.46 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
Start reading Algorithms (4th Edition) on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Algorithms (4th Edition) [Hardcover]

by Robert Sedgewick, Kevin Wayne
4.4 out of 5 stars  See all reviews (57 customer reviews)

Buy New
$59.12 & FREE Shipping. Details
Rent
$20.28 - $33.41
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
In Stock.
Want it tomorrow, April 25? Choose One-Day Shipping at checkout. Details
Free Two-Day Shipping for College Students with Amazon Student

Formats

Amazon Price New from Used from
Kindle Edition $36.49  
Hardcover $59.12  
Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

Book Description

March 19, 2011 032157351X 978-0321573513 4th

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.


    Frequently Bought Together

    Algorithms (4th Edition) + Cracking the Coding Interview: 150 Programming Questions and Solutions + Introduction to Algorithms
    Price for all three: $164.62

    Buy the selected items together


    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

    • Hardcover: 992 pages
    • Publisher: Addison-Wesley Professional; 4th edition (March 19, 2011)
    • Language: English
    • ISBN-10: 032157351X
    • ISBN-13: 978-0321573513
    • Product Dimensions: 2.9 x 3.6 x 0.6 inches
    • Shipping Weight: 3 pounds (View shipping rates and policies)
    • Average Customer Review: 4.4 out of 5 stars  See all reviews (57 customer reviews)
    • Amazon Best Sellers Rank: #9,803 in Books (See Top 100 in Books)

    Customer Reviews

    Most Helpful Customer Reviews
    250 of 259 people found the following review helpful
    5.0 out of 5 stars Best algorithms textbook by far May 21, 2011
    Format:Hardcover
    "Algorithms" (4th edn) by Robert Sedgewick and Kevin Wayne (published
    by Addison-Wesley in March 2011) is one of the best computer science
    books I have ever read. It should be required reading for all CS
    students and all programmers - it aims to cover the "50 algorithms
    every programmer should know". Below I discuss some of the main
    reasons why I think the book is so good.

    Unlike its main rival, "An introduction to algorithms" by Cormen,
    Leiserson, Rivest and Stein (CLRS), "Algorithms" contains actual
    source code (written in a subset of Java). The importance of this
    cannot be overstated: it means students can actually use the
    algorithms to solve real problems. This enables a wealth of
    interesting and motivating applications --- from web search to
    genomics --- which are sprinkled throughout the book. (Source code and
    data are available on the book's website.)

    A natural worry with real code is that it will obscure the basic
    ideas. However, by careful useful of abstract data types (classes
    such as queues, bags, hash tables, trees, DAGs, etc), the authors have
    done a masterful job at creating extremely concise and readable
    implementations.

    Using real code also forces one to address important implementation
    details that are easy to overlook. For example, it is well known that
    mergesort requires auxiliary memory. In the CLRS pseudocode, they
    allocate temporary storage space inside their merge routine. In
    practice it is much more efficient to allocate temporary storage space
    once, and then pass this in as a pointer to the merge function (or let
    it be a private member of the mergesort class). Where else can you
    learn such important tricks?
    Read more ›
    Was this review helpful to you?
    57 of 61 people found the following review helpful
    5.0 out of 5 stars Updated Review For Fourth Edition April 11, 2011
    Format:Hardcover
    Other reviews on this fine text are for older editions with pseudo code. Sedgewick and Wayne have completely revised this new Fourth Edition with plentiful Java scripts for a vast range of applications. A brand new website at Princeton is dedicated to this book and has visualizations, much more code, exercises, answers, bib links, full implementations of many problems, and a complete online summary and synopsis of the book.

    The authors suggest this is for a second course in CS, but many serious students, whether independent or in undergrad, will find it useful for self teaching as well. In fact, the new website has self teaching resources if you are "going it alone" in your initial study of algorithms.

    Algos cannot really be separated from their underlying data structures, and a serious new addition to this printing and edition is a much better backgrounder on the most up to date data structures, using hyper modern examples like Amazon and Google.

    This book covers the basics, and is not an encyclopedia or reference book. It has a lot of detailed descriptions and visuals, and takes the time to be sure the student "gets" the point. In a way, it is in competition with Sedgewick's own Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching (Pts. 1-4), which is now in its third edition, and more terse, advanced and encyclopedic. If you want a thorough understanding of the whole field, you probably need both if you're just starting out in the field.

    If you're a beginning programmer, and want to get into the underlying logic of sorts, searches, graphs, strings and other fundamentals that drive modeling and the web, this is the place to start.
    Comment | 
    Was this review helpful to you?
    26 of 26 people found the following review helpful
    4.0 out of 5 stars My preferred algorithms text May 9, 2012
    Format:Hardcover
    I've recently switched to this from the Cormen et al. book for the algorithms class I teach at Lewis & Clark College (a small liberal arts college in Portland, OR). The main difference is that this book focuses on practice, where Cormen focuses more on mathematical theory. This book seems a better fit for my students and my style of teaching.

    Pros:
    * Reasonable scope for a semester. Teaching from this book for the first time, I covered four of the six large chapters, plus part of the fifth.
    * Explanations, diagrams, and examples are clear and concise.
    * The authors know their stuff and don't hesitate to explain it. For example, they know why a hash table index should be computed as
    (key.hashCode() & 0x7fffffff) % M
    (where M is the size of the table) instead of
    Math.abs(key.hashCode()) % M
    * The slides provided on the book website are outstanding.
    * Examples in the book and on the slides come from a wide variety of applications. They demonstrate cases where using the efficient algorithm really matters.
    * One of the authors responds quickly to questions and errata. (As with any textbook, be sure to check the website and write the corrections into your copy.)

    Cons:
    * The code does not always follow Java style conventions. For example, the authors will use non-private fields and one-letter, upper-case variable names. The many classes provided are all in the default package. It is not clear how much of this stems from deliberate decisions in the name of clarity and conciseness and how much from the authors not being "native" Java speakers.
    * Some of the proofs are a bit laconic ("immediate from inspection of the code").
    * The authors use an unusual ~ notation instead of the more widely-used Big-Theta/Big-O notation (although the latter is explained in passing). The ~ notation is more precise, as it does not omit the constant factor, but students may need additional practice with the standard notation.
    Comment | 
    Was this review helpful to you?
    Most Recent Customer Reviews
    3.0 out of 5 stars Good book to start out with, not so much after
    I picked this up to relearn algorithm before grad school. It covers all the basic/intermediate topics that is the core of computer science and then some added topics. Read more
    Published 16 days ago by bluedaemon
    5.0 out of 5 stars Good book with a very practical approach
    This book explains in a clear and practical way the use of several well known algorithms, which are the base for any one pursuing a career in CS.
    Published 1 month ago by Edgar H. Rodriguez
    5.0 out of 5 stars Excellent Book
    I started to learn algorithms first using CLR book. It was good, but I find this book helps me to understand algorithms much better, I always try to implement the datastructures,... Read more
    Published 1 month ago by Nadiia
    5.0 out of 5 stars 2nd Best Textbook
    I feel that Cormen is a better textbook, but this one is very pleasant to read and understand. Compared to the previous editions, many optional topics have been trimmed, and... Read more
    Published 1 month ago by Linda
    5.0 out of 5 stars Best algorithm book ever used, esp in Java
    Best algorithm book ever used, esp in Java. The logic is clear and the examples are in details. Work closely to Java in practice
    Published 1 month ago by Feng Zheng
    5.0 out of 5 stars Great book to pick up algorithms
    I learned algorithms and data structure years ago. I now need a good book to pick up the knowledge in this field. Read more
    Published 1 month ago by Yingchuan Hu
    5.0 out of 5 stars if (!cart.contains(this.book)) { cart.insert(this.book); }
    Having a good grasp of Algorithms can be the difference between:

    - your computation never completing and your computation completing in minutes or hours,
    -... Read more
    Published 1 month ago by Timothy J. Stewart
    5.0 out of 5 stars Awesome book!
    Everything is explained in simple manner! The quality of the book itself is perfect! You can attend coursera courses that are made on the base of this book by its author.
    Published 2 months ago by Fry
    5.0 out of 5 stars this book covers all algorithms themes I need
    this book covers all algorithms themes I need. It is pleasure to read this book and improve algorithms knowledge. Nice choice!
    Published 4 months ago by Sergii G.
    5.0 out of 5 stars Great book at teaching fundamental Algorithms
    It's an absolutely great book. The examples are written in a concise manner with easy to follow code and instructions. Read more
    Published 5 months ago by Nick D.
    Search Customer Reviews
    Only search this product's reviews
    ARRAY(0xa17a09cc)

    What Other Items Do Customers Buy After Viewing This Item?


    Forums

    There are no discussions about this product yet.
    Be the first to discuss this product with the community.
    Start a new discussion
    Topic:
    First post:
    Prompts for sign-in
     



    Look for Similar Items by Category