{"product_id":"algorithmic-thinking-2-e","title":"Algorithmic Thinking, 2\/e","description":"\u003cp\u003e\u003cb\u003eGet in the game and learn essential computer algorithms by solving competitive programming problems, in the fully revised second edition of the bestselling original. (Still no math required!)\u003c\/b\u003e\u003c\/p\u003e\u003cp\u003eKnowing how to design algorithms will take you from being a good programmer to a great programmer. This completely revised second edition teaches you how to design your own rocket-fast, right-for-the-task algorithms—minus the proofs and complex math. Forget the useless pseudocode and played-out examples you’ve seen in other books. Author and award-winning educator Dan Zingaro draws problems straight from online programming competitions to rigorously teach you all of the heavyweights you need to know, like hash tables, recursion, trees, graphs, and heaps. As he guides you to the perfect algorithmic solution for each unique programming puzzle, you’ll build up a toolkit of go-to algorithms for quickly and correctly solving any problem you come across.\u003c\/p\u003e\u003cp\u003eThe second edition features several entirely new chapters on dynamic programming and randomized algorithms, as well as more effective problems and enhanced explanations. Code examples are provided using the C language.\u003c\/p\u003e\u003cp\u003eLearn how to:\u003c\/p\u003e\u003cul\u003e\n\u003cli\u003e\u003cspan class=\"a-list-item\"\u003eClassify problems, choose data structures, and identify appropriate algorithms\u003c\/span\u003e\u003c\/li\u003e\n\u003cli\u003e\u003cspan class=\"a-list-item\"\u003eChoose between data structures like hash tables, heaps, or trees, based on how they affect runtime and speed\u003c\/span\u003e\u003c\/li\u003e\n\u003cli\u003e\u003cspan class=\"a-list-item\"\u003eAdopt powerful strategies like recursion, dynamic programming, and binary search to solve challenging problems\u003c\/span\u003e\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan class=\"a-list-item\"\u003eApply the breadth-first search algorithm to find the optimal way to play a board game, Dijkstra’s algorithm to determine the fastest routes between two locations, and many more\u003c\/span\u003e\u003cb\u003eGet in the game and learn essential computer algorithms by solving competitive programming problems, in the fully revised second edition of the bestselling original. (Still no math required!)\u003c\/b\u003e\u003cbr\u003eKnowing how to design algorithms will take you from being a good programmer to a great programmer. This completely revised second edition teaches you how to design your own rocket-fast, right-for-the-task algorithms—minus the proofs and complex math. Forget the useless pseudocode and played-out examples you’ve seen in other books. Author and award-winning educator Dan Zingaro draws problems straight from online programming competitions to rigorously teach you all of the heavyweights you need to know, like hash tables, recursion, trees, graphs, and heaps. As he guides you to the perfect algorithmic solution for each unique programming puzzle, you’ll build up a toolkit of go-to algorithms for quickly and correctly solving any problem you come across.The second edition features several entirely new chapters on dynamic programming and randomized algorithms, as well as more effective problems and enhanced explanations. Code examples are provided using the C language.Learn how to:\u003cul\u003e\n\u003cli\u003e\u003cspan class=\"a-list-item\"\u003eClassify problems, choose data structures, and identify appropriate algorithms\u003c\/span\u003e\u003c\/li\u003e\n\u003cli\u003e\u003cspan class=\"a-list-item\"\u003eChoose between data structures like hash tables, heaps, or trees, based on how they affect runtime and speed\u003c\/span\u003e\u003c\/li\u003e\n\u003cli\u003e\u003cspan class=\"a-list-item\"\u003eAdopt powerful strategies like recursion, dynamic programming, and binary search to solve challenging problems\u003c\/span\u003e\u003c\/li\u003e\n\u003cli\u003e\u003cspan class=\"a-list-item\"\u003eApply the breadth-first search algorithm to find the optimal way to play a board game, Dijkstra’s algorithm to determine the fastest routes between two locations, and many more\u003c\/span\u003e\u003c\/li\u003e\n\u003c\/ul\u003e\n\u003c\/li\u003e\n\u003c\/ul\u003e\u003ch3\u003eAbout the Author\u003c\/h3\u003e\u003cp\u003e\u003cb\u003eDr. Daniel Zingaro\u003c\/b\u003e is an award-winning Assistant Professor of Mathematical and Computational Sciences at the University of Toronto Mississauga, where he is well known for his uniquely interactive approach to teaching and internationally recognized for his expertise in Active Learning. He is also the author of \u003ci\u003eLearn to Code by Solving Problems\u003c\/i\u003e (No Starch Press, 2021).\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eTable of contents \u003cbr\u003eForeword\u003cbr\u003eIntroduction\u003cbr\u003eAcknowledgments\u003c\/strong\u003e\u003cbr\u003eChapter 1: Hash Tables\u003cbr\u003eChapter 2: Trees and Recursion\u003cbr\u003eChapter 3: Memoization and Dynamic Programming\u003cbr\u003eChapter 4: Advanced Memoization and Dynamic Programming\u003cbr\u003eChapter 5: Graphs and Breadth-First Search\u003cbr\u003eChapter 6: Shortest Paths in Weighted Graphs\u003cbr\u003eChapter 7: Binary Search\u003cbr\u003eChapter 8: Heaps and Segment Trees\u003cbr\u003eChapter 9: Union-Find\u003cbr\u003eChapter 10: Randomization\u003cbr\u003e\u003cstrong\u003eAfterword\u003c\/strong\u003e\u003cbr\u003eAppendix A: Algorithm Runtime\u003cbr\u003eAppendix B: Because I Can’t Resist\u003cbr\u003eAppendix C: Problem Credits\u003cbr\u003eIndex\u003c\/p\u003e","brand":"No Starch Press","offers":[{"title":"Paperback","offer_id":50506315235398,"sku":"9781718503229","price":4186.0,"currency_code":"INR","in_stock":true},{"title":"E-Book","offer_id":50506315268166,"sku":"9781718503229-2","price":3939.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0754\/2797\/1142\/files\/51pl4HXV7QL._SX377_BO1_204_203_200.jpg?v=1790326553","url":"https:\/\/cb-india.com\/products\/algorithmic-thinking-2-e","provider":"Computer Bookshop (India) Pvt Ltd","version":"1.0","type":"link"}