|
|
Sold Out
Book Categories |
| 1 | Introduction | 1 |
| 1.1 | What's the Book About? | 1 |
| 1.2 | Mathematics Review | 3 |
| 1.3 | A Brief Introduction to Recursion | 8 |
| 2 | Algorithm Analysis | 15 |
| 2.1 | Mathematical Background | 15 |
| 2.2 | Model | 18 |
| 2.3 | What to Analyze | 18 |
| 2.4 | Running Time Calculations | 21 |
| 3 | Lists, Stacks, and Queues | 41 |
| 3.1 | Abstract Data Types (ADTs) | 41 |
| 3.2 | The List ADT | 42 |
| 3.3 | The Stack ADT | 61 |
| 3.4 | The Queue ADT | 77 |
| 4 | Trees | 87 |
| 4.1 | Preliminaries | 87 |
| 4.2 | Binary Trees | 93 |
| 4.3 | The Search Tree ADT - Binary Search Trees | 98 |
| 4.4 | AVL Trees | 107 |
| 4.5 | Splay Trees | 117 |
| 4.6 | Tree Traversals (Revisited) | 131 |
| 4.7 | B-Trees | 133 |
| 5 | Hashing | 149 |
| 5.1 | General Idea | 149 |
| 5.2 | Hash Function | 150 |
| 5.3 | Open Hashing (Separate Chaining) | 152 |
| 5.4 | Closed Hashing (Open Addressing) | 157 |
| 5.5 | Rehashing | 165 |
| 5.6 | Extendible Hashing | 168 |
| 6 | Priority Queues (Heaps) | 177 |
| 6.1 | Model | 177 |
| 6.2 | Simple Implementations | 178 |
| 6.3 | Binary Heap | 179 |
| 6.4 | Applications of Priority Queues | 189 |
| 6.5 | d-Heaps | 192 |
| 6.6 | Leftist Heaps | 193 |
| 6.7 | Skew Heaps | 200 |
| 6.8 | Binomial Queues | 202 |
| 7 | Sorting | 217 |
| 7.1 | Preliminaries | 217 |
| 7.2 | Insertion Sort | 218 |
| 7.3 | A Lower Bound for Simple Sorting Algorithms | 219 |
| 7.4 | Shellsort | 220 |
| 7.5 | Heapsort | 224 |
| 7.6 | Mergesort | 226 |
| 7.7 | Quicksort | 232 |
| 7.8 | Sorting Large Structures | 244 |
| 7.9 | A General Lower Bound for Sorting | 244 |
| 7.10 | Bucket Sort | 247 |
| 7.11 | External Sorting | 247 |
| 8 | The Disjoint Set ADT | 261 |
| 8.1 | Equivalence Relations | 261 |
| 8.2 | The Dynamic Equivalence Problem | 262 |
| 8.3 | Basic Data Structure | 263 |
| 8.4 | Smart Union Algorithms | 266 |
| 8.5 | Path Compression | 268 |
| 8.6 | Worst Case for Union-by-Rank and Path Compression | 271 |
| 8.7 | An Application | 277 |
| 9 | Graph Algorithms | 281 |
| 9.1 | Definitions | 281 |
| 9.2 | Topological Sort | 284 |
| 9.3 | Shortest-Path Algorithms | 288 |
| 9.4 | Network Flow Problems | 306 |
| 9.5 | Minimum Spanning Tree | 311 |
| 9.6 | Applications of Depth-First Search | 317 |
| 9.7 | Introduction to NP-Completeness | 330 |
| 10 | Algorithm Design Techniques | 345 |
| 10.1 | Greedy Algorithms | 345 |
| 10.2 | Divide and Conquer | 363 |
| 10.3 | Dynamic Programming | 378 |
| 10.4 | Randomized Algorithms | 390 |
| 10.5 | Backtracking Algorithms | 399 |
| 11 | Amortized Analysis | 425 |
| 11.1 | An Unrelated Puzzle | 426 |
| 11.2 | Binomial Queues | 426 |
| 11.3 | Skew Heaps | 431 |
| 11.4 | Fibonacci Heaps | 433 |
| 11.5 | Splay Trees | 443 |
| Price | Condition | Delivery | Seller | Action |
| $101.07 | Digital |
| WonderClub |
Christopher Foltz
reviewed Data Structures and Algorithm Analysis in C on June 05, 2019 Data Structures and Algorithm Analysis in C
A great balance of theoretical rigorous and practical implementation. The book covers undergraduate data structure + algorithm. The level of theoretical rigorous is less than CLRS but I find it is a good supplemental to CLRS. For example, the author gives relative concise but still detail enough to the graph algorithms. CLRS gives much in-depth analysis. I would highly recommend anyone who wants to start learning algorithm to try out this book. In addition, the book also covers many advanced data structures like skiplist, kd-tree, and red-black tree.
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
Data Structures and Algorithm Analysis in C
X
This Item is in Your Inventory
Data Structures and Algorithm Analysis in C
X
You must be logged in to review the productsX
X
X
Add Data Structures and Algorithm Analysis in C, In this second edition of his best-selling book, Data Structures and Algorithm Analysis in C, Mark Allen Weiss, continues to refine and enhance his innovative approach to algorithms and data structures. Using a C implementation, he highlights conce, Data Structures and Algorithm Analysis in C to the inventory that you are selling on WonderClubX
X
Add Data Structures and Algorithm Analysis in C, In this second edition of his best-selling book, Data Structures and Algorithm Analysis in C, Mark Allen Weiss, continues to refine and enhance his innovative approach to algorithms and data structures. Using a C implementation, he highlights conce, Data Structures and Algorithm Analysis in C to your collection on WonderClub |