Algorithms – Robert Sedgewick, Kevin Wayne – 4th Edition

Description

This fourth edition of Sedgewick and ’s is the leading textbook on today and is widely used in colleges and universities worldwide. This book surveys the most important computer currently in use and provides a full treatment of and for sorting, searching, graph processing, and string processing — fifty every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.

The algorithms in this book represent a body of developed over the last 50 years that has become indispensable, not just for professional programmers and computer science but for any student with interests in science, , and , not to mention who use in the liberal arts.

Table of Content

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