Algorithms, 4th edition

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

  • Robert Sedgewick
  • Kevin Wayne

eTextbook on Pearson+

ISBN-13: 9780137459575 (2021 update)
per month
Pay monthly or
pay undefined one-time
Buy nowOpens in a new tab
Instant access

eTextbook rental includes

  • Instant access to eTextbook
  • Search, highlight, and notes
  • Create flashcards
Products list
$71.99

Price Reduced From: $89.99

Details

  • A print text
  • Free shipping
  • Also available for purchase as an ebook from all major ebook resellers, including InformIT.com
  • 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

    • This publication contains markup to enable structural navigation and compatibility with assistive technologies. Images in the publication MAY NOT be fully described, which is a barrier to those who rely on alternative text descriptions. The publication supports text reflow and contains no content hazards known to cause adverse physical reactions.

    Need help? Get in touch