Title
Mastering Algorithms with C: Useful Techniques from Sorting to Encryption,Used
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
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 programming tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of the information you need to understand the purpose and use of common programming techniques.Implementations, as well as interesting, realworld examples of each data structure and algorithm, are included.Using both a programming style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations. The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of concepts in an approachable manner for people who never have had the time or expertise to study them in depth.Anyone with a basic understanding of the C language can use this book. In order to provide maintainable and extendible code, an extra level of abstraction (such as pointers to functions) is used in examples where appropriate. Understanding that these techniques may be unfamiliar to some programmers, Loudon explains them clearly in the introductory chapters.Contents include: Pointers Recursion Analysis of algorithms Data structures (lists, stacks, queues, sets, hash tables, trees, heaps, priority queues, graphs) Sorting and searching Numerical methods Data compression Data encryption Graph algorithms Geometric algorithms
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What is the size of the book? A: The book measures seven point zero one inches in length, one point one eight inches in width, and nine point one nine inches in height.
- Q: How many pages does this book have? A: This book contains five hundred sixty pages, providing an extensive overview of algorithms and their implementations.
- Q: What type of binding does this book have? A: The book is available in a paperback binding, making it flexible and easy to handle.
- Q: What programming language does this book focus on? A: The book focuses on the C programming language, offering practical techniques and examples for various algorithms.
- Q: Is this book suitable for beginners? A: Yes, this book is suitable for anyone with a basic understanding of the C language, including beginners.
- Q: Can I find real-world examples in this book? A: Yes, the book includes interesting real-world examples of each data structure and algorithm, enhancing practical understanding.
- Q: How should I care for this book? A: Keep the book in a dry place, away from direct sunlight, to preserve its condition and readability.
- Q: Is this book safe for children? A: Yes, the content is educational and suitable for older children who are learning programming.
- Q: What if the book arrives damaged? A: If the book arrives damaged, you should contact the seller for return instructions or a replacement.
- Q: Does this book include a warranty? A: No, this book does not include a warranty, but standard return policies apply.
- Q: Is this book useful for professional programmers? A: Yes, professional programmers can find advanced techniques and insights into algorithms that enhance their skills.
- Q: What topics are covered in this book? A: The book covers topics such as sorting, searching, data compression, and encryption, among other essential algorithms.
- Q: Does this book explain complex concepts thoroughly? A: Yes, the author provides clear explanations of complex concepts, making them approachable for readers.
- Q: Can I use this book for self-study? A: Yes, this book is designed for self-study, offering robust solutions and explanations suitable for independent learners.
- Q: Is there a focus on data structures in this book? A: Yes, the book emphasizes essential data structures such as lists, stacks, queues, trees, and graphs.
- Q: Are the algorithms in this book efficient? A: Yes, the book discusses the relative efficiency of all implementations, helping readers understand performance.