# Algorithms, 4th Edition

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 algs4.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.

*Integrated with the Web*

Visit algs4.cs.princeton.edu for a freely accessible, comprehensive Web site, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources.

**Table of Contents**

Chapter 1: Fundamentals

Programming Model

Data Abstraction

Bags, Stacks, and Queues

Analysis of Algorithms

Case Study: Union-Find

Chapter 2: Sorting

Elementary Sorts

Mergesort

Quicksort

Priority Queues

Applications

Chapter 3: Searching

Symbol Tables

Binary Search Trees

Balanced Search Trees

Hash Tables

Applications

Chapter 4: Graphs

Undirected Graphs

Directed Graphs

Minimum Spanning Trees

Shortest Paths

Chapter 5: Strings

String Sorts

Tries

Substring Search

Regular Expressions

Data Compression

Chapter 6: Context

### Book Details

**Hardcover:**976 pages**Publisher:**Addison-Wesley Professional; 4th Edition (February, 2011)**Language:**English**ISBN-10:**032157351X**ISBN-13:**978-0321573513

Thanks, so much!!

Awesome. Thank you very much 😉

Very useful. Thanks.

Already 3rd book on algorythms you’re posted lately, that’s very interesting and useful. Thanks!

Thanks a lot!