Mastering Algorithms
Rahul Bhandari
Sold by Rarewaves.com USA, London, LONDO, United Kingdom
AbeBooks Seller since June 11, 2025
New - Soft cover
Condition: New
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Add to basketSold by Rarewaves.com USA, London, LONDO, United Kingdom
AbeBooks Seller since June 11, 2025
Condition: New
Quantity: Over 20 available
Add to basketAlgorithms are the foundational language of computing, driving everything from efficient search engines to complex machine learning. Acquiring them is essential for any developer or computer scientist seeking to build high-performance, scalable software.
The book explores the fundamental data structures like arrays, stacks, queues, linked lists, hashing, and various trees, as well as binomial and Fibonacci heaps. With this foundation, you will explore a wide range of sorting and searching algorithms, from simple methods to more advanced techniques like radix sort and exponential search. You will gain a deep understanding of general methods and applications of divide and conquer, greedy algorithms, dynamic programming, backtracking, and branch and bound, each explained with classic examples.
By the end of this book, you will possess the knowledge and skills needed to tackle challenges head-on, whether in academia or the ever-evolving landscape of technology. You will be prepared for the challenges of building robust software in any professional setting.
What you will learn
● Analyze algorithm and program performance metrics.
● Master fundamental data structures for efficiency.
● Understand sorting algorithms like quick sort, merge sort.
● Explore searching techniques like binary search.
● Apply divide and conquer for problem-solving.
● Design greedy algorithms for optimization tasks.
● Implement graph algorithms for network analysis.
Who this book is for
This book is for students, programmers, and coders who have a foundational understanding of programming. Readers should be comfortable with basic syntax and logic to fully engage with the algorithmic concepts and their implementations.
Table of Contents
1. Algorithm and Program Performance
2. Review of Data Structures
3. Sorting Algorithms
4. Searching Algorithms
5. Divide and Conquer
6. Greedy Algorithms
7. Dynamic Programming
8. Backtracking
9. Branch and Bound
10. Graph Algorithms
11. Computational Complexity
12. Other Advanced Algorithms
APPENDIX: Most Frequently Asked Questions
"About this title" may belong to another edition of this title.
Please note that we do not offer Priority shipping to any country.
We currently do not ship to the below countries:
Russia
Belarus
Ukraine
Israel
Please do not attempt to place orders with any of these countries as a ship to address - they will be cancelled.
| Order quantity | 9 to 14 business days | 9 to 14 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 0.00 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.