{"product_id":"grokking-algorithms-second-edition-9781633438538","title":"Grokking Algorithms, Second Edition","description":"\u003cb\u003eA friendly, fully-illustrated introduction to the most important computer programming algorithms.\u003c\/b\u003e \u003cp\u003e\u003c\/p\u003eMaster 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! \u003cp\u003e\u003c\/p\u003eIn \u003ci\u003eGrokking Algorithms, Second Edition\u003c\/i\u003e you will discover: \u003cp\u003e\u003c\/p\u003e \u003cul\u003e \u003cli\u003eSearch, sort, and graph algorithms\u003c\/li\u003e \u003cli\u003eData structures such as arrays, lists, hash tables, trees, and graphs\u003c\/li\u003e \u003cli\u003eNP-complete and greedy algorithms\u003c\/li\u003e \u003cli\u003ePerformance trade-offs between algorithms\u003c\/li\u003e \u003cli\u003eExercises and code samples in every chapter\u003c\/li\u003e \u003cli\u003eOver 400 illustrations with detailed walkthroughs\u003c\/li\u003e \u003c\/ul\u003e \u003cbr\u003eThe 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. \u003cp\u003e\u003c\/p\u003e Foreword by Daniel Zingaro. \u003cp\u003e\u003c\/p\u003ePurchase of the print book includes a free eBook in PDF and ePub formats from Manning Publications. \u003cp\u003e\u003c\/p\u003e \u003cb\u003eAbout the technology\u003c\/b\u003e \u003cp\u003e\u003c\/p\u003e 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! \u003cp\u003e\u003c\/p\u003e \u003cb\u003eAbout the book\u003c\/b\u003e \u003cp\u003e\u003c\/p\u003e 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. \u003cp\u003e\u003c\/p\u003e \u003cb\u003eWhat's inside\u003c\/b\u003e \u003cp\u003e\u003c\/p\u003e \u003cul\u003e \u003cli\u003eSearch, sort, and graph algorithms\u003c\/li\u003e \u003cli\u003eData structures such as arrays, lists, hash tables, trees, and graphs\u003c\/li\u003e \u003cli\u003eNP-complete and greedy algorithms\u003c\/li\u003e \u003cli\u003eExercises and code samples in every chapter\u003c\/li\u003e \u003c\/ul\u003e \u003cp\u003e\u003c\/p\u003e\u003cb\u003eAbout the reader\u003c\/b\u003e \u003cp\u003e\u003c\/p\u003e No advanced math or programming skills required. \u003cp\u003e\u003c\/p\u003e \u003cb\u003eAbout the author\u003c\/b\u003e \u003cp\u003e\u003c\/p\u003e \u003cb\u003eAditya Bhargava\u003c\/b\u003e is a Software Engineer with a dual background in Computer Science and Fine Arts. He blogs on programming at adit.io. \u003cp\u003e\u003c\/p\u003eTable of Contents \u003cp\u003e\u003c\/p\u003e 1 Introduction to algorithms\u003cbr\u003e 2 Selection sort\u003cbr\u003e 3 Recursion\u003cbr\u003e 4 Quicksort\u003cbr\u003e 5 Hash tables\u003cbr\u003e 6 Beadth-first search\u003cbr\u003e 7 Trees\u003cbr\u003e 8 Balanced trees\u003cbr\u003e 9 Dijkstra's algorithm\u003cbr\u003e 10 Greedy algorithms\u003cbr\u003e 11 Dynamic programming\u003cbr\u003e 12 k-nearest neighbors\u003cbr\u003e 13 where to go next\u003cbr\u003e\u003cbr\u003e\u003cbr\u003e\u003cb\u003eAbout the Author\u003c\/b\u003e\u003cbr\u003e\u003cb\u003eAditya Bhargava\u003c\/b\u003e is a Software Engineer with a dual background in Computer Science and Fine Arts. He blogs on programming at adit.io.\u003cbr\u003e","brand":"Manning Publications","offers":[{"title":"Default Title","offer_id":50606610481426,"sku":"9781633438538","price":45.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0831\/4771\/8930\/files\/img_7875f382-2a28-47c6-9a4b-bfbc32f4c363.jpg?v=1732296958","url":"https:\/\/surprise-castle.myshopify.com\/products\/grokking-algorithms-second-edition-9781633438538","provider":"Surprise Castle","version":"1.0","type":"link"}