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

Name: Algorithms in C++ Fundamentals, Data Structure, Sorting, Searching
Price: 5.72 USD
Availability: InStock
ISBN: 9780201350883

ISBN-10: 0201350882

ISBN-13: 9780201350883

Edition: 3rd 1999 (Revised)

Authors: Robert Sedgewick

List price: $74.99

30 day, 100% satisfaction guarantee!

Marketplace

3 new & used from $5.72

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

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 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…

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.816
Language: English



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: