"This is an eminently readable book which an ordinary programmer, unskilled in mathematical analysis and wary of theoretical algorithms, ought to be able to pick up and get a lot out of.."
- Steve Summit, author of C Programming FAQs
Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive.
- William A. Ward, University of South Alabama
Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers!
This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The algorithms and data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language.
- Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures
- Greater emphasis on abstract data types (ADTs) than in previous editions
- Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations
- New implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more
- Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them
- Over 1000 new exercises to help you learn the properties of algorithms
Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.
|Product dimensions:||7.70(w) x 9.10(h) x 1.60(d)|
Table of Contents
A Sample Problem -- Connectivity.
Union-Find Algorithms. Perspective.
Summary Of Topics.
Principles Of Algorithm Analysis.
Predictions And Guarantees.
Growth Of Functions.
Example: Connectivity Algorithms.
II. DATA STRUCTURES.
Elementary Data Structures.
Types And Structures.
Elementary List Processing.
Storage Allocation For Lists.
Trees And Recursion.
Properties Of Trees.
Representing Binary Trees.
Elementary Recursive Programs.
Elementary Abstract Data Types.
Pushdown Stack Adt.
Stack Adt Implementations.
Queue Adts And Implementations.
String Adt And Implementations.
Set Adt And Implementations.
Amortized Growth For Array Implementations.
Elementary Sorting Methods.
Rules Of The Game.
Performance Characteristics Of Elementary Sorts.
Sorting Other Types Of Data.
Index And Pointer Sorting.
Sorting Linked Lists.
The Basic Algorithm.
Performance Characteristics Of Quicksort.
Strings And Vectors.
Abstract Implace Merge.
Improvements To The Basic Algorithm.
Performance Characteristics Of Mergesort.
Linked-List Implementations Of Mergesort.
Priority Queues And Heapsort.
Heap Data Structure.
Algorithms On Heaps.
Priority-Queue Abstract Data Type.
Indirect Priority Queues.
Bits, Bytes, And Words.
Msd Radix Sort.
Three-Way Radix Quicksort.
Lsd Radix Sort.
Performance Characteristics Of Radix Sorts.
Batcher's Odd-Even Mergesort.
Symbol Tables And Bsts.
Symbol-Table Abstract Data Type.
Binary Search Trees.
Performance Characteristics Of Bsts.
Index Implementations With Symbol Tables.
Insertion At The Root In Bsts.
Bst Implementations Of Other Adt Functions.
Top-Down 2-3-4 Trees.
Dynamic Hash Tables.
Digital Search Trees.
Multiway Tries And Tsts.
Text String Index Applications.
Indexed Sequential Access.
List Of Figures.