Title
Grokking Algorithms, Second Edition,New
Processing time: 1-3 days
US Orders Ships in: 3-5 days
International Orders Ships in: 8-12 days
Return Policy: 15-days return on defective items
Payment Option
A friendly, fullyillustrated introduction to the most important computer programming algorithms.The algorithms you'll use most often as a programmer have already been discovered, tested, and proven. This book will prepare you for those pesky algorithms questions in every programming job interview and help you apply them in your daytoday work. And if you want to understand them without slogging through dense multipage proofs, this is the book for you.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 tradeoffs between algorithms Exercises and code samples in every chapter Over 400 illustrations with detailed walkthroughsThe first edition of Grokking Algorithms proved to over 100,000 readers that learning algorithms doesn't have to be complicated or boring! This new edition now includes fresh coverage of trees, NP complete problems, and code updates to Python 3. With easytoread, friendly explanations, clever examples, and exercises to sharpen your skills as you learn, youll actually enjoy learning these important algorithms.About the bookGrokking Algorithms, Second Edition makes it easy to learn. Youll never be boredcomplex concepts are all explained through fun cartoons and memorable examples that make them stick. You'll start with tasks like sorting and searching, then build your skills to tackle more advanced problems like data compression and artificial intelligence.This revised second edition contains brand new coverage of trees, including binary search trees, balanced trees, Btrees and more. Youll also discover fresh insights on data structure performance that takes account of modern CPUs. Plus, the books fully annotated code samples have been updated to Python 3. By the time you reach the last page, youll have mastered the most widely applicable algorithms, know when and how to use them, and be fully prepared when youre asked about them on your next job interview.About the readerSuitable for selftaught programmers, engineers, job seekers, or anyone who wants to brush up on algorithms.About the authorAditya Bhargava is a Software Engineer with a dual background in Computer Science and Fine Arts. He blogs on programming at adit.io.
⚠️ 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.