Algorithms 4th Edition

Description

The latest version of Sedgewick's best-selling series, reflecting an indispensable body of knowledge developed over the past several decades.

Full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing, including fifty algorithms every programmer should know. See title= "http://algs4.cs.princeton.edu/code" " algs4.cs.princeton.edu/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.

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.

Engages reader interest with clear, concise text, detailed examples with visuals, carefully crafted code, historical and scientific context, and exercises at all levels.

Develops precise statements about performance, supported by appropriate mathematical models and empirical studies validating those models.

Visit title= "http://algs4.cs.princeton.edu/" " 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.

Contents

<P style="MARGIN: 0px Chapter 1: Fundamentals

<P style="MARGIN: 0px Programming Model

<P style="MARGIN: 0px Data Abstraction

<P style="MARGIN: 0px Bags, Stacks, and Queues

<P style="MARGIN: 0px Analysis of Algorithms

<P style="MARGIN: 0px Case Study: Union-Find

<P style="MARGIN: 0px

<P style="MARGIN: 0px Chapter 2: Sorting

<P style="MARGIN: 0px Elementary Sorts

<P style="MARGIN: 0px Mergesort

<P style="MARGIN: 0px Quicksort

<P style="MARGIN: 0px Priority Queues

<P style="MARGIN: 0px Applications

<P style="MARGIN: 0px

<P style="MARGIN: 0px Chapter 3: Searching

<P style="MARGIN: 0px Symbol Tables

<P style="MARGIN: 0px Binary Search Trees

<P style="MARGIN: 0px Balanced Search Trees

<P style="MARGIN: 0px Hash Tables

<P style="MARGIN: 0px Applications

<P style="MARGIN: 0px

<P style="MARGIN: 0px Chapter 4: Graphs

<P style="MARGIN: 0px Undirected Graphs

<P style="MARGIN: 0px Directed Graphs

<P style="MARGIN: 0px Minimum Spanning Trees

<P style="MARGIN: 0px Shortest Paths

<P style="MARGIN: 0px

<P style="MARGIN: 0px Chapter 5: Strings

<P style="MARGIN: 0px String Sorts

<P style="MARGIN: 0px Tries

<P style="MARGIN: 0px Substring Search

<P style="MARGIN: 0px Regular Expressions

<P style="MARGIN: 0px Data Compression

<P style="MARGIN: 0px

<P style="MARGIN: 0px Chapter 6: Context

CONTENTS:

1.1 Basic Programming Model 8

2.1 Elementary Sorts 244

3.1 Symbol Tables 362

4.1 Undirected Graphs 518

5.1 String Sorts 702