|
|
Sold Out
Book Categories |
Preface
I. Preliminaries
1. Introduction
An Introduction to Data Structures
An Introduction to Algorithms
A Bit About Software Engineering
How to Use This Book
2. Pointer Manipulation
Pointer Fundamentals
Storage Allocation
Aggregates and Pointer Arithmetic
Pointers as Parameters to Functions
Generic Pointers and Casts
Function Pointers
Questions and Answers
Related Topics
3. Recursion
Basic Recursion
Tail Recursion
Questions and Answers
Related Topics
4. Analysis of Algorithms
Worst-Case Analysis
O-Notation
Computational Complexity
Analysis Example: Insertion Sort
Questions and Answers
Related Topics
II. Data Structures
5. Linked Lists
Description of Linked Lists
Interface for Linked Lists
Implementation and Analysis of Linked Lists
Linked List Example: Frame Management
Description of Doubly-Linked Lists
Interface for Doubly-Linked Lists
Implementation and Analysis of Doubly Linked Lists
Description of Circular Lists
Interface for Circular Lists
Implementation and Analysis of Circular Lists
Circular List Example: Second-Chance Page Replacement
Questions and Answers
Related Topics
6. Stacks and Queues
Description of Stacks
Interface for Stacks
Implementation and Analysis of Stacks
Description of Queues
Interface for Queues
Implementation and Analysis of Queues
Queue Example: Event Handling
Questions and Answers
Related Topics
7. Sets
Description of Sets
Interface for Sets
Implementation and Analysis of Sets
Set Example: Set Covering
Questions and Answers
Related Topics
8. Hash Tables
Description of Chained Hash Tables
Interface for Chained Hash Tables
Implementation and Analysis of Chained Hash Tables
Chained Hash Table Example: Symbol Tables
Description of Open-Addressed Hash Tables
Interface for Open-Addressed Hash Tables
Implementation and Analysis of Open Addressed Hash Tables
Questions and Answers
Related Topics
9. Trees
Description of Binary Trees
Interface for Binary Trees
Implementation and Analysis of Binary Trees
Binary Tree Example: Expression Processing
Description of Binary Search Trees
Interface for Binary Search Trees
Implementation and Analysis of Binary Search Trees
Questions and Answers
Related Topics
10. Heaps and Priority Queues
Description of Heaps
Interface for Heaps
Implementation and Analysis of Heaps
Description of Priority Queues
Interface for Priority Queues
Implementation and Analysis of Priority Queues
Priority Queue Example: Parcel Sorting
Questions and Answers
Related Topics
11. Graphs
Description of Graphs
Interface for Graphs
Implementation and Analysis of Graphs
Graph Example: Counting Network Hops
Graph Example: Topological Sorting
Questions and Answers
Related Topics
III. Algorithms
12. Sorting and Searching
Description of Insertion Sort
Interface for Insertion Sort
Implementation and Analysis of Insertion Sort
Description of Quicksort
Interface for Quicksort
Implementation and Analysis of Quicksort
Quicksort Example: Directory Listings
Description of Merge Sort
Interface for Merge Sort
Implementation and Analysis of Merge Sort
Description of Counting Sort
Interface for Counting Sort
Implementation and Analysis of Counting Sort
Description of Radix Sort
Interface for Radix Sort
Implementation and Analysis of Radix Sort
Description of Binary Search
Interface for Binary Search
Implementation and Analysis of Binary Search
Binary Search Example: Spell Checking
Questions and Answers
Related Topics
13. Numerical Methods
Description of Polynomial Interpolation
Interface for Polynomial Interpolation
Implementation and Analysis of Polynomial Interpolation
Description of Least-Squares Estimation
Interface for Least-Squares Estimation
Implementation and Analysis of Least-Squares Estimation
Description of the Solution of Equations
Interface for the Solution of Equations
Implementation and Analysis of the Solution of Equations
Questions and Answers
Related Topics
14. Data Compression
Description of Bit Operations
Interface for Bit Operations
Implementation and Analysis of Bit Operations
Description of Huffman Coding
Interface for Huffman Coding
Implementation and Analysis of Huffman Coding
Huffman Coding Example: Optimized Networking
Description of LZ77
Interface for LZ77
Implementation and Analysis of LZ77
Questions and Answers
Related Topics
15. Data Encryption
Description of DES
Interface for DES
Implementation and Analysis of DES
DES Example: Block Cipher Modes
Description of RSA
Interface for RSA
Implementation and Analysis of RSA
Questions and Answers
Related Topics
16. Graph Algorithms
Description of Minimum Spanning Trees
Interface for Minimum Spanning Trees
Implementation and Analysis of Minimum Spanning Trees
Description of Shortest Paths
Interface for Shortest Paths
Implementation and Analysis of Shortest Paths
Shortest Paths Example: Routing Tables
Description of the Traveling-Salesman Problem
Interface for the Traveling-Salesman Problem
Implementation and Analysis of the Traveling-Salesman Problem
Questions and Answers
Related Topics
17. Geometric Algorithms
Description of Testing Whether Line Segments Intersect
Interface for Testing Whether Line Segments Intersect
Implementation and Analysis of Testing Whether Line Segments Intersect
Description of Convex Hulls
Interface for Convex Hulls
Implementation and Analysis of Convex Hulls
Description of Arc Length on Spherical Surfaces
Interface for Arc Length on Spherical Surfaces
Implementation and Analysis of Arc Length on Spherical Surfaces
Arc Length Example: Approximating Distances on Earth
Questions and Answers
Related Topics
Index
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Andre Schnor
reviewed Mastering Algorithms with C on September 04, 2013
Mastering Algorithms with C
I tried to go on with this book but I just couldn't. It's not the fact that is badly written. It's the code and the design that make it a turnoff (at least in my case).
I picked up this book after K&R and I started reading it in parallel with Robert Sedgewick's Algorithms in C Parts 1-4. I have quickly noticed the resemblance but I was curious to also see the differences. Mastering Algorithms in C uses a much modern coding style but it is also more opinionated. The whole coding style seams much more complex and that is a pretty big minus. Let's also not talk about the comments... "I don't want to adopt your coding style, I just want to learn how to improve mine!" That's my main problem with it. The only thing that i found to be great was the Q&A section.
I don't expect everybody to share my opinion but I usually want to read top notch learning material written by already recognized figures. So I will stick with Sedgewick.
If you want lo learn about data structures and algorithms in C just pick Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching. You won't regret. That's as good as it gets.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Mastering Algorithms with C
X
This Item is in Your Inventory
Mastering Algorithms with C
X
You must be logged in to review the productsX
X
X
Add Mastering Algorithms with C, There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday , Mastering Algorithms with C to the inventory that you are selling on WonderClubX
X
Add Mastering Algorithms with C, There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday , Mastering Algorithms with C to your collection on WonderClub |
