Algorithms in C++ Fundamentals, Data Structure, Sorting, Searching

ISBN-10: 0201350882
ISBN-13: 9780201350883
Edition: 3rd 1999 (Revised)
Authors: Robert Sedgewick
List price: $74.99 Buy it from $23.29
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description: For this version of Robert Sedgewick's popular textbook on algorithms and data structures, Christopher Van Wyk and Robert Sedgewick have developed new C++ implementations that both express the presented methods in a concise and direct manner, and  More...

Used Starting from $47.11
New Starting from $72.99
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $74.99
Edition: 3rd
Copyright year: 1999
Publisher: Addison Wesley Professional
Publication date: 7/13/1998
Binding: Paperback
Pages: 752
Size: 8.00" wide x 9.25" long x 1.00" tall
Weight: 2.904
Language: English

For this version of Robert Sedgewick's popular textbook on algorithms and data structures, Christopher Van Wyk and Robert Sedgewick have developed new C++ implementations that both express the presented methods in a concise and direct manner, and also provide students with the practical means to test them on real applications. This particular book, Parts 1-4, represents a substantial update of the first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The update features expanded coverage of arrays, linked lists, strings, trees, and other basic data structures, and greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions. It includes over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations, and over 1,000 new exercises to help students learn the properties of algorithms.

Fundamentals
Introduction
Algorithms
A Sample Problem-Connectivity
Union-Find Algorithms
Perspective
Summary of Topics
Principles of Algorithm Analysis
Implementation and Empirical Analysis
Analysis of Algorithms
Growth of Functions
Big-Oh Notation
Basic Recurrences
Examples of Algorithm Analysis
Guarantees, Predictions, and Limitations
Data Structures
Elementary Data Structures
Building Blocks
Arrays
Linked Lists
Elementary List Processing
Memory Allocation for Lists
Strings
Compound Data Structures
Abstract Data Types
Abstract Objects and Collections of Objects
Pushdown Stack ADT
Examples of Stack ADT Clients
Stack ADT Implementations
Creation of a New ADT
FIFO Queues and Generalized Queues
Duplicate and Index Items
First-Class ADTs
Application-Based ADT Example
Perspective
Recursion and Trees
Recursive Algorithms
Divide and Conquer
Dynamic Programming
Trees
Mathematical Properties of Trees
Tree Traversal
Recursive Binary-Tree Algorithms
Graph Traversal
Perspective
Sorting
Elementary Sorting Methods
Rules of the Game
Selection Sort
Insertion Sort
Bubble Sort
Performance Characteristics of Elementary Sorts
Shellsort
Sorting Other Types of Data
Index and Pointer Sorting
Sorting Linked Lists
Key-Indexed Counting
<div STYLE="margin-left:

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×