Algorithms, 4th edition

  • Robert Sedgewick, 
  • Kevin Wayne

Choose the option that's right for you

$9.99 / mo

4-month term, pay monthly or pay $39.96

Enjoy these features

  • Up to 2 devices
  • Exclusive offers

$14.99 / mo

4-month term, pay monthly or pay $59.96

Enjoy these features

  • Up to 2 devices
  • Exclusive offers

Learn more, spend less

  • Listen on the go

    Learn how you like with full eTextbook audio

  • Learn anytime, anywhere

    Get the app to access your eTextbook whenever you need it

  • Make it your own

    Your notes. Your highlights. Your eTextbook

  • Find it fast

    Quickly navigate your eTextbook with search

  • Stay organized

    Access all your eTextbooks in one place


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

Choose from one eTextbook or over 1,500 eTextbooks and study tools, all in one place, for one low monthly subscription. A Single plan includes the use of 1 eTextbook title and study tools. A Multi plan gives you access to more than 1,500 eTextbook titles and study tools. Plus, with the app, put textbooks in your pocket and learn wherever.

Make the most of your study time with offline access, enhanced search, notes and flashcards — to get organized, get the work done quicker and get results.

A Pearson eTextbook is an easy-to-use digital version of the book. You can add notes and highlights, plus learn on the go with the Pearson+ mobile app. Listen on the go with the audiobook feature, available for most titles.

When you choose a plan, you're signing up for a 4-month 'term'. You can opt to 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 has ended. You can turn on auto-renew in My account at any time to continue your subscription before your 4-month term has ended.

When you purchase a Pearson+ subscription, it will last 4 months. Before your initial 4-month term ends, you can extend your subscription by turning auto-renew on in My account.

If you turn auto-renew on, we’ll automatically renew your subscription and charge you every month until you turn off auto-renew. If you made a one-time payment for your initial 4-month term, you’ll now pay monthly.

To avoid the next payment charge, make sure you turn auto renewal off 1 day before the auto renewal date. You can subscribe again after auto-renew has been turned off by purchasing another Pearson+ subscription. We use your credit card to renew your subscription automatically. To make sure your learning is uninterrupted, please check your card details before your first monthly payment.

With a Multi Pearson+ subscription plan, you can download up to 10 titles from your library on each of your authorized smartphone and tablet devices every month.

When you’re using your Multi Pearson+ subscription plan in a browser, you can select and read from as many titles as you like.