Algorithmic Thinking Learn Algorithms to Level Up Your Coding Skills
-
- Taschenbuch ausgewählt
- eBook
-
Sprache:Englisch
46,99 €
inkl. gesetzl. MwSt.,
Lieferung nach Hause
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
23.01.2024
Verlag
Random House LLC USSeitenzahl
438
Maße (L/B/H)
23,6/17,8/2,9 cm
Gewicht
904 g
Farbe
Natur / Schwarz
Auflage
2nd Edition
Sprache
Englisch
ISBN
978-1-71850-322-9
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:
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
Kundinnen und Kunden meinen
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kund*innen durch Ihre Meinung
Kurze Frage zu unserer Seite
Vielen Dank für dein Feedback
Wir nutzen dein Feedback, um unsere Produktseiten zu verbessern. Bitte habe Verständnis, dass wir dir keine Rückmeldung geben können. Falls du Kontakt mit uns aufnehmen möchtest, kannst du dich aber gerne an unseren Kund*innenservice wenden.
zum Kundenservice