{"product_id":"grokking-algorithms-second-edition-an-illustrated-guide-for-programmers-and-other-curious-people","title":"Grokking Algorithms, Second Edition: An illustrated guide for programmers and other curious people","description":"\u003cp\u003eA friendly, fully-illustrated introduction to the most important computer programming algorithms.\u003c\/p\u003e\n\n\u003cp\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!\u003c\/p\u003e\n\n\u003cp\u003eIn  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\u003cbr\u003e\nThe 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.\u003c\/p\u003e\n\n\u003cp\u003eForeword by Daniel Zingaro.\u003c\/p\u003e\n\n\u003cp\u003eAbout the technology\u003c\/p\u003e\n\n\u003cp\u003eThe 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!\u003c\/p\u003e\n\n\u003cp\u003eAbout the book\u003c\/p\u003e\n\n\u003cp\u003eGrokking 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.\u003c\/p\u003e\n\n\u003cp\u003eWhat'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\u003cbr\u003e\nAbout the reader\u003c\/p\u003e\n\n\u003cp\u003eNo advanced math or programming skills required.\u003c\/p\u003e\n\n\u003cp\u003eAbout the author\u003c\/p\u003e\n\n\u003cp\u003eAditya Bhargava  is a Software Engineer with a dual background in Computer Science and Fine Arts. He blogs on programming at adit.io.\u003c\/p\u003e\n\n\u003cp\u003eTable of Contents\u003c\/p\u003e\n\n\u003cp\u003e1 Introduction to algorithms\u003cbr\u003e\n2 Selection sort\u003cbr\u003e\n3 Recursion\u003cbr\u003e\n4 Quicksort\u003cbr\u003e\n5 Hash tables\u003cbr\u003e\n6 Beadth-first search\u003cbr\u003e\n7 Trees\u003cbr\u003e\n8 Balanced trees\u003cbr\u003e\n9 Dijkstra’s algorithm\u003cbr\u003e\n10 Greedy algorithms\u003cbr\u003e\n11 Dynamic programming\u003cbr\u003e\n12 k-nearest neighbors\u003cbr\u003e\n13 where to go next\u003c\/p\u003e","brand":"ANT","offers":[{"title":"Ebook","offer_id":52891211235615,"sku":"A1478","price":42.49,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0957\/0546\/5119\/files\/ebook_836_dffdec3e59.jpg?v=1789631932","url":"https:\/\/lumobook.store\/products\/grokking-algorithms-second-edition-an-illustrated-guide-for-programmers-and-other-curious-people","provider":"LumoBook","version":"1.0","type":"link"}