Skip to content

Algorithms in C Fundamentals, Data Structures, Sorting, Searching

Spend $50 to get a free DVD!

ISBN-10: 0201314525

ISBN-13: 9780201314526

Edition: 3rd 1998 (Revised)

Authors: Robert Sedgewick

List price: $89.99
Shipping box This item qualifies for FREE shipping.
Blue ribbon 30 day, 100% satisfaction guarantee!
Buy eBooks
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!


Parts 1-4 of Robert Sedgewick's work provide extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. They reflect the third edition's greater emphasis on abstract data types (ADTs). Coverage includes more than 100 key algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations. Also included are new implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, and multiway tries. Increased quantitative information gives students a more solid basis for comparing algorithms, and hundreds of new exercises reinforce their learning. Algorithms and data structures described in the book are expressed in concise implementations in C, so that students can both appreciate their fundamental properties and test them on real applications.
Customers also bought

Book details

List price: $89.99
Edition: 3rd
Copyright year: 1998
Publisher: Addison Wesley Professional
Publication date: 9/17/1997
Binding: Paperback
Pages: 720
Size: 7.75" wide x 9.50" long x 1.25" tall
Weight: 2.926
Language: English

A Sample Problem
Union-Find Algorithms
Summary Of Topics
Principles Of Algorithm Analysis
Empirical Analysis
Predictions And Guarantees
Growth Of Functions
Big-Oh Notation
Example: Connectivity Algorithms
Computational Complexity
Data Structures
Elementary Data Structures
Types And Structures
Linked Lists
Elementary List Processing
Storage Allocation For Lists
Compound Structures
Trees And Recursion
Properties Of Trees
Representing Binary Trees
Representing Forests
Traversing Trees
Elementary Recursive Programs
Depth-First Search
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
Elementary Sorting Methods
Rules Of The Game
Selection Sort
Insertion Sort
Bubble Sort
Performance Characteristics Of Elementary Sorts
Sorting Other Types Of Data
Index And Pointer Sorting
Sorting Linked Lists
Distribution Counting
The Basic Algorithm
Performance Characteristics Of Quicksort
Stack Size
Small Subfiles
Median-Of-Three Partitioning
Equal Keys
Strings And Vectors
Two-Way Merging
Abstract Implace Merge
Top-Down Mergesort
Improvements To The Basic Algorithm
Bottom-Up Mergesort
Performance Characteristics Of Mergesort
Linked-List Implementations Of Mergesort
Recursion Revisited
Priority Queues And Heapsort
Elementary Implementations
Heap Data Structure
Algorithms On Heaps
Priority-Queue Abstract Data Type
Indirect Priority Queues
Binomial Queues
Radix Sorting
Bits, Bytes, And Words
Binary Quicksort
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
Sorting Networks
External Sorting
Sort-Merge Implementations
Parallel Sort/Merge
Symbol Tables And Bsts
Symbol-Table Abstract Data Type
Key-Indexed Search
Sequential Search
Binary Search
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
Randomized Bsts
Splay Bsts
Top-Down 2-3-4 Trees
Red-Black Trees
Skip Lists
Performance Characteristics
Hash Functions