Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne

Algorithms, 4th Edition.: essential information that every serious programmer
needs to know about algorithms and data structures

Textbook.

 The textbook Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne [ Amazon · Addison-Wesley ] surveys the most important algorithms and data structures in use today. The textbook is organized into six chapters:

• Chapter 1: Fundamentals introduces a scientific and engineering basis for comparing algorithms and making predictions. It also includes our programming model.
• Chapter 2: Sorting considers several classic sorting algorithms, including insertion sort, mergesort, and quicksort. It also includes a binary heap implementation of a priority queue.
• Chapter 3: Searching describes several classic symbol table implementations, including binary search trees, red-black trees, and hash tables.
• Chapter 4: Graphs surveys the most important graph processing problems, including depth-first search, breadth-first search, minimum spanning trees, and shortest paths.
• Chapter 5: Strings investigates specialized algorithms for string processing, including string sorting, substring search, tries, regular expressions, and data compression.
• Chapter 6: Context highlights connections to systems programming, scientific computing, commercial applications, operations research, and intractability.

Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm that we address by examining its impact on specific applications.

Booksite.

 Reading a book and surfing the web are two different activities: This booksite is intended for your use while online (for example, while programming and while browsing the web); the textbook is for your use when initially learning new material and when reinforcing your understanding of that material (for example, when reviewing for an exam). The booksite consists of the following elements:

• Excerpts. A condensed version of the text narrative for reference while online.
• Java code. Here is a list of the algorithms and clients in this textbook.
• Exercise solutions. Solutions to selected exercises.

	PDF SLIDES
0	INTRODUCTION
0	Introduction
1	FUNDAMENTALS
1.1	Programming Model
1.2	Data Abstraction
1.3	Stacks and Queues
1.4	Analysis of Algorithms
1.5	Case Study: Union Find
2	SORTING
2.1	Elementary Sorts
2.2	Mergesort
2.3	Quicksort
2.4	Priority Queues
3	SEARCHING
3.1	Elementary Symbol Tables
3.2	Binary Search Trees
3.3	Balanced Search Trees
3.4	Hash Tables
3.5	Searching Applications
4	GRAPHS
4.1	Undirected Graphs
4.2	Directed Graphs
4.3	Minimum Spanning Trees
4.4	Shortest Paths
5	STRINGS
5.1	String Sorts
5.2	Tries
5.3	Substring Search
5.4	Regular Expressions
5.5	Data Compression