Request full copy

Algorithms, 4th edition

Published by Addison-Wesley Professional (March 24, 2011) © 2011

  • Robert Sedgewick Princeton University
  • Kevin Wayne

eTextbook

per month

  • Anytime, anywhere learning with the Pearson+ app
  • Easy-to-use search, navigation and notebook
  • Simpler studying with flashcards
$71.99

  • A print text (hardcover or paperback) 
  • Free shipping
  • Also available for purchase as an ebook from all major ebook resellers, including InformIT.com

This fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms is one of the most popular textbooks on algorithms today and is widely used in colleges and universities worldwide. The algorithms in this book – including 50 algorithms every programmer should know – 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 and for students who use computation in the liberal arts. 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 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, offered each fall and spring, 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.


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 state-of-the-art textbook, online content, and MOOC, they have built a unique resource that greatly expands the breadth and depth of the educational experience.

  • The #1 practical resource for everyone seeking to run programs faster or solve larger problems
  • Surveys today's most useful algorithms, with copious illustrations and examples
  • Contains many new examples, ranging from physics, biology, and engineering to data compression and web search
  • Contains real (not pseudocode) implementations, with detailed performance insights
  • A companion web site, algs4.cs.princeton.edu , with many more resources for instructors, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources
  • Many powerful new algorithms
  • A broader perspective with more science and engineering applications
  • New illustrations and examples throughout
  • An attractive new two-color design
  • A companion web site, algs4.cs.princeton.edu , with many more resources for instructors, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources
    • Chapter 1: Fundamentals
    • 1.1 Programming Model
       
  • 1.2 Data Abstraction
  • 1.3 Queues, Stacks, and Bags
  • 1.4 Analysis of Algorithms
  • 1.5 Case Study: Union-Find
  •  
  • Chapter 2: Sorting
  • 2.1 Elementary Sorts
    2.1 Elementary Sorts
  • 2.2 Mergesort
  • 2.3 Quicksort
  • 2.4 Priority Queues
  • 2.5 Applications
  •  
  • Chapter 3: Searching
  • 3.1 Symbol Tables
    3.1 Symbol Tables
  • 3.2 Binary Search Trees
  • 3.3 Balanced Search Trees
  • 3.4 Hash Tables
  • 3.5 Applications
  •  
  • Chapter 4: Graphs
  • 4.1 Undirected graphs
    4.1 Undirected graphs
  • 4.2 Directed graphs
  • 4.3 Minimum Spanning Trees
  • 4.4 Shortest Paths
  •  
  • Chapter 5: Strings
  • 5.1 String Sorts
    5.1 String Sorts
  • 5.2 Tries
  • 5.3 Substring Search
  • 5.4 Regular Expressions
  • 5.5 Data Compression
  •  
  • Context
  • Systems Programming
    Systems Programming
  • Scientific Computing
  • Commercial Applications
  • Operations Research
  • Intractability
  •  
  • Index

    • 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).

    Need help? Get in touch

    Pearson+

    All in one place. Pearson+ offers instant access to eTextbooks, videos and study tools in one intuitive interface. Students choose how they learn best with enhanced search, audio and flashcards. The Pearson+ app lets them read where life takes them, no wi-fi needed. Students can access Pearson+ through a subscription or their MyLab or Mastering course.

    Video
    Play
    Privacy and cookies
    By watching, you agree Pearson can share your viewership data for marketing and analytics for one year, revocable by deleting your cookies.

    Video transcript (PDF | 16KB) 

    Pearson eTextbook: What’s on the inside just might surprise you

    They say you can’t judge a book by its cover. It’s the same with your students. Meet each one right where they are with an engaging, interactive, personalized learning experience that goes beyond the textbook to fit any schedule, any budget, and any lifestyle. 

    Digital Learning NOW

    Extend your professional development and meet your students where they are with free weekly Digital Learning NOW webinars. Attend live, watch on-demand, or listen at your leisure to expand your teaching strategies. Earn digital professional development badges for attending a live session.

    Explore webinars