0
Your cart

Your cart is empty

Books

Buy Now

Algorithmic Thinking, 2nd Edition - A Problem-Based Introduction Loot Price: R825
Discovery Miles 8 250
You Save: R202 (20%)
Algorithmic Thinking, 2nd Edition - A Problem-Based Introduction: Daniel Zingaro

Algorithmic Thinking, 2nd Edition - A Problem-Based Introduction

Daniel Zingaro

 (sign in to rate)
Was R1,027 Loot Price R825 Discovery Miles 8 250 | Repayment Terms: R77 pm x 12* You Save R202 (20%)

Bookmark and Share

Expected to ship within 10 - 15 working days

Get 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!) Knowing 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: Classify problems, choose data structures, and identify appropriate algorithms Choose between data structures like hash tables, heaps, or trees, based on how they affect runtime and speed Adopt powerful strategies like recursion, dynamic programming, and binary search to solve challenging problems Apply 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

General

Imprint: No Starch Press,Us
Country of origin: United States
Release date: 2024
Authors: Daniel Zingaro
Dimensions: 235 x 178mm (L x W)
Pages: 440
ISBN-13: 978-1-71850-322-9
Categories: Books
Promotions
LSN: 1-71850-322-9
Barcode: 9781718503229

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners