Algorithms, 4th edition

Published by Addison Wesley (December 15, 2021) © 2011

  • Robert Sedgewick
  • Kevin Wayne
Products list

Details

  • A print text
  • Free shipping
  • Also available for purchase as an ebook from all major ebook resellers, including InformIT.com
Products list

Details

  • A print text
  • Free shipping
  • Also available for purchase as an ebook from all major ebook resellers, including InformIT.com
Products list

Details

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

Title overview

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.

Table of contents

  • 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
  • Need help?Get in touch