This eBook includes the following formats, accessible from your Account page after purchase:
EPUB The open industry format known for its reflowable content and usability on supported mobile devices.
MOBI The eBook format compatible with the Amazon Kindle and Amazon Kindle applications.
PDF The popular standard, used most often with the free Adobe® Reader® software.
This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.
Also available in other formats.
Register your product to gain access to bonus material or receive a coupon.
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.
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.
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.
Perspective.Trees And Recursion.
Properties Of Trees.
Representing Binary Trees.
Elementary Recursive Programs.
Removing Recursion.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.
III. SORTING.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.
Recursion Revisited.Priority Queues And Heapsort.
Heap Data Structure.
Algorithms On Heaps.
Priority-Queue Abstract Data Type.
Indirect Priority Queues.
Binomial Queues.Radix Sorting.
Bits, Bytes, And Words.
Msd Radix Sort.
Three-Way Radix Quicksort.
Lsd Radix Sort.
Performance Characteristics Of Radix Sorts.
Sublinear-Time Sorts.Special-Purpose Sorts.
Batcher's Odd-Even Mergesort.
IV. SEARCHING.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.Balanced Trees.
Top-Down 2-3-4 Trees.
Dynamic Hash Tables.
Digital Search Trees.
Multiway Tries And Tsts.
Text String Index Applications.External Searching.
Indexed Sequential Access.
Virtual Memory.Program Index.