+612 9045 4394
Algorithms in C++, Parts 1-4 : Fundamentals, Data Structure, Sorting, Searching - Robert Sedgewick

Algorithms in C++, Parts 1-4

Fundamentals, Data Structure, Sorting, Searching

Paperback Published: 23rd July 1998
ISBN: 9780201350883
Number Of Pages: 752

Share This Book:


RRP $217.99
or 4 easy payments of $38.19 with Learn more
Ships in 7 to 10 business days

Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications.

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 1n4, 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. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations.

  • Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures
  • Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes 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, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more
  • Increased quantitative information about the algorithms, giving you a basis for comparing them
  • Over 1000 new exercises to help you learn the properties of algorithms

Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

A Sample Problem-Connectivity
Union-Find Algorithms
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
Linked Lists
Elementary List Processing
Memory Allocation for Lists
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
Recursion and Trees
Recursive Algorithms
Divide and Conquer
Dynamic Programming
Mathematical Properties of Trees
Tree Traversal
Recursive Binary-Tree Algorithms
Graph Traversal
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
Key-Indexed Counting
<div STYLE="margin-left:
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780201350883
ISBN-10: 0201350882
Series: Algorithms in C++
Audience: Tertiary; University or College
Format: Paperback
Language: English
Number Of Pages: 752
Published: 23rd July 1998
Publisher: Pearson Education (US)
Country of Publication: US
Dimensions (cm): 23.2 x 20.0  x 3.7
Weight (kg): 1.18
Edition Number: 3
Edition Type: Revised