Algorithms, 4th edition

  • Robert Sedgewick, 
  • Kevin Wayne

Your access includes:

  • Search, highlight, and take notes
  • Easily create flashcards
  • Use the app for access anywhere
  • 14-day refund guarantee

$10.99per month

4-month term, pay monthly or pay $43.96

Learn more, spend less

  • Listen on the go

    Learn how you like with full eTextbook audio

  • Special partners and offers

    Enjoy perks from special partners and offers for students

  • Find it fast

    Quickly navigate your eTextbook with search

  • Stay organized

    Access all your eTextbooks in one place

  • Easily continue access

    Keep learning with auto-renew


The leading introduction to computer algorithms in use today, including fifty algorithms every programmer should know

Princeton Computer Science professors, Robert Sedgewick and Kevin Wayne, survey the most important computer algorithms in use and of interest to anyone working in science, mathematics, and engineering, and those who use computation in the liberal arts. They provide a full treatment of data structures and algorithms for key areas that enable you to confidently implement, debug, and put them to work in any computational environment.


  • Basic programming models
  • Data abstraction
  • Bags, queues, and stacks
  • Analysis of algorithms


  • Elementary sorts
  • Mergesort
  • Quicksort
  • Priority queues
  • Applications


  • Undirected graphs
  • Directed graphs
  • Minimum spanning trees
  • Shortest paths


  • String sorts
  • Tries
  • Substring search
  • Regular expressions
  • Data compression

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.

Published by Addison Wesley (December 15th 2021) - Copyright © 2011

ISBN-13: 9780137459575

Subject: General Engineering

Category: Engineering Math

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

Your questions answered

Pearson+ is your one-stop shop, with eTextbooks and study videos designed to help students get better grades in college.

A Pearson eTextbook is an easy‑to‑use digital version of the book. You'll get upgraded study tools, including enhanced search, highlights and notes, flashcards and audio. Plus learn on the go with the Pearson+ app.

Your eTextbook subscription gives you access for 4 months. You can make a one‑time payment for the initial 4‑month term or pay monthly. If you opt for monthly payments, we will charge your payment method each month until your 4‑month term ends. You can turn on auto‑renew in My account at any time to continue your subscription before your 4‑month term ends.

When you purchase an eTextbook subscription, it will last 4 months. You can renew your subscription by selecting Extend subscription on the Manage subscription page in My account before your initial term ends.

If you extend your subscription, we'll automatically charge you every month. If you made a one‑time payment for your initial 4‑month term, you'll now pay monthly. To make sure your learning is uninterrupted, please check your card details.

To avoid the next payment charge, select Cancel subscription on the Manage subscription page in My account before the renewal date. You can subscribe again in the future by purchasing another eTextbook subscription.

Channels is a video platform with thousands of explanations, solutions and practice problems to help you do homework and prep for exams. Videos are personalized to your course, and tutors walk you through solutions. Plus, interactive AI‑powered summaries and a social community help you better understand lessons from class.

Channels is an additional tool to help you with your studies. This means you can use Channels even if your course uses a non‑Pearson textbook.

When you choose a Channels subscription, you're signing up for a 1‑month, 3‑month or 12‑month term and you make an upfront payment for your subscription. By default, these subscriptions auto‑renew at the frequency you select during checkout.

When you purchase a Channels subscription it will last 1 month, 3 months or 12 months, depending on the plan you chose. Your subscription will automatically renew at the end of your term unless you cancel it.

We use your credit card to renew your subscription automatically. To make sure your learning is uninterrupted, please check your card details.