Sedgewick R., Wayne K. Algorithms 4ed 2011

Textbook in PDF format

Essential Information about Algorithms and Data Structures
A Classic Reference
The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades.
Broad Coverage
Full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing, including fifty algorithms every programmer should know. See algs
4.cs.princeton.edu/code.
Completely Revised Code
New Java implementations written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.
Engages with Applications
Algorithms are studied in the context of important scientific, engineering, and commercial applications. Clients and algorithms are expressed in real code, not the pseudo-code found in many other books.
Intellectually Stimulating
Engages reader interest with clear, concise text, detailed examples with visuals, carefully crafted code, historical and scientific context, and exercises at all levels.
A Scientific Approach
Develops precise statements about performance, supported by appropriate mathematical models and empirical studies validating those models.
Preface
Fundamentals
Basic Programming Model
Data Abstraction
Bags, Queues, and Stacks
Analysis of Algorithms
Case Study: Union-Find
Sorting
Elementary Sorts
Mergesort
Quicksort
Priority Queues
Applications
Searching
Symbol Tables
Binary Search Trees
Balanced Search Trees
Hash Tables
Applications
Graphs
Undirected Graphs
Directed Graphs
Minimum Spanning Trees
Shortest Paths
Strings
String Sorts
Tries
Substring Search
Regular Expressions
Data Compression
Context
Index
Algorithms
Clients