Grokking Algorithms, Second Edition
$49.99
5 in stock
Refresh Stock LevelInformation
Shipping
We currently offer free shipping on all orders over $100. Standard media mail shipping is $7.50 plus $1 for each additional book. Electronics are $35 shipping on all items.
Books
We get our books from a national distributor and although we strive to present up to date stock counts, stock constantly fluctuates. We perform a stock check when you add your book to the cart to ensure that it is available for shipping from the distributor. You can also check stock status by clicking the refresh stock link on the product page for the most up to date stock at the distributor. If an item is on backorder, you may place an order and we will update you on the estimated ship date as soon as we can confirm with the distributor.
Return & exchange
If you are not satisfied with your purchase you can return it to us within 14 days for an exchange or refund. More info.
Assistance
Can’t find what you’re looking for? We have access to over 13 million titles, reach out and see if we can help!
Contact us on (575) 322-6867, or email us at business@rabsbooks.com.
| Weight | 1.2 lbs |
|---|---|
| Dimensions | 9.13 × 7.32 × 0.87 in |
Description
A friendly, fully-illustrated introduction to the most important computer programming algorithms.
Master the most widely used algorithms and be fully prepared when you’re asked about them at your next job interview. With beautifully simple explanations, over 400 fun illustrations, and dozens of relevant examples, you’ll actually enjoy learning about algorithms with this fun and friendly guide! In Grokking Algorithms, Second Edition you will discover:- Search, sort, and graph algorithms
- Data structures such as arrays, lists, hash tables, trees, and graphs
- NP-complete and greedy algorithms
- Performance trade-offs between algorithms
- Exercises and code samples in every chapter
- Over 400 illustrations with detailed walkthroughs
The first edition of Grokking Algorithms proved to over 100,000 readers that learning algorithms doesn’t have to be complicated or boring! This revised second edition contains brand new coverage of trees, including binary search trees, balanced trees, B-trees and more. You’ll also discover fresh insights on data structure performance that takes account of modern CPUs. Plus, the book’s fully annotated code samples have been updated to Python 3.
Foreword by Daniel Zingaro. Purchase of the print book includes a free eBook in PDF and ePub formats from Manning Publications. About the technology The algorithms you use most often have already been discovered, tested, and proven. Grokking Algorithms, Second Edition makes it a breeze to learn, understand, and use them. With beautifully simple explanations, over 400 fun illustrations, and dozens of relevant examples, it’s the perfect way to unlock the power of algorithms in your everyday work and prepare for your next coding interview–no math required! About the book Grokking Algorithms, Second Edition teaches you important algorithms to speed up your programs, simplify your code, and solve common programming problems. Start with tasks like sorting and searching, then build your skills to tackle advanced problems like data compression and artificial intelligence. You’ll even learn to compare the performance tradeoffs between algorithms. Plus, this new edition includes fresh coverage of trees, NP-complete problems, and code updates to Python 3. What’s inside- Search, sort, and graph algorithms
- Data structures such as arrays, lists, hash tables, trees, and graphs
- NP-complete and greedy algorithms
- Exercises and code samples in every chapter
2 Selection sort
3 Recursion
4 Quicksort
5 Hash tables
6 Beadth-first search
7 Trees
8 Balanced trees
9 Dijkstra’s algorithm
10 Greedy algorithms
11 Dynamic programming
12 k-nearest neighbors
13 where to go next
Manning Publications
Reviews
There are no reviews yet.