Grokking Algorithms
Afbeeldingen
Artikel vergelijken
- Engels
- Hardcover
- 9781633438538
- 14 maart 2024
- 320 pagina's
Samenvatting
A friendly, fully-illustrated introduction to the most important computer programming algorithms. Suitable for self-taught programmers, engineers, job seekers, or anyone who wants to brush up on algorithms.
From the Back Cover
Grokking Algorithms, Second Edition makes it easy to learn. You'll never be bored - complex concepts are all explained through fun cartoons and memorable examples that make them stick. You'll start with tasks like sorting and searching, then build your skills to tackle more advanced problems like data compression and artificial intelligence.
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. By the time you reach the last page, you'll have mastered the most widely applicable algorithms, know when and how to use them, and be fully prepared when you’re asked about them on your next job interview.
About the reader
Suitable for self-taught programmers, engineers, job seekers, or anyone who wants to brush up on algorithms.
A friendly, fully-illustrated introduction to the most important computer programming algorithms.
The algorithms you'll use most often as a programmer have already been discovered, tested, and proven. This book will prepare you for those pesky algorithms questions in every programming job interview and help you apply them in your day-to-day work. And if you want to understand them without slogging through dense multipage proofs, this is the book for you.
In 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
The first edition of Grokking Algorithms proved to over 100,000 readers that learning algorithms doesn't have to be complicated or boring! This new edition now includes fresh coverage of trees, NP complete problems, and code updates to Python 3. With easy-to-read, friendly explanations, clever examples, and exercises to sharpen your skills as you learn, you’ll actually enjoy learning these important algorithms.
Productspecificaties
Inhoud
- Taal
- en
- Bindwijze
- Hardcover
- Oorspronkelijke releasedatum
- 14 maart 2024
- Aantal pagina's
- 320
- Illustraties
- Nee
Betrokkenen
- Hoofdauteur
- Aditya Bhargava
- Tweede Auteur
- Bhargava, Aditya Y
- Hoofduitgeverij
- Manning Publications
Overige kenmerken
- Editie
- 2
- Product breedte
- 190 mm
- Product hoogte
- 20 mm
- Product lengte
- 235 mm
- Studieboek
- Nee
- Verpakking breedte
- 190 mm
- Verpakking hoogte
- 20 mm
- Verpakking lengte
- 235 mm
- Verpakkingsgewicht
- 599 g
EAN
- EAN
- 9781633438538
Je vindt dit artikel in
- Categorieën
- Taal
- Engels
- Beschikbaarheid
- Leverbaar
- Nieuw verschenen
- Nieuw verschenen
- Boek, ebook of luisterboek?
- Boek
Kies gewenste uitvoering
Prijsinformatie en bestellen
De prijs van dit product is 35 euro en 99 cent. De meest getoonde prijs is 47 euro en 99 cent. Je bespaart 25%.- Prijs inclusief verzendkosten, verstuurd door bol
- Ophalen bij een bol afhaalpunt mogelijk
- 30 dagen bedenktijd en gratis retourneren
- Dag en nacht klantenservice
- Doordeweeks ook ’s avonds in huis
Rapporteer dit artikel
Je wilt melding doen van illegale inhoud over dit artikel:
- Ik wil melding doen als klant
- Ik wil melding doen als autoriteit of trusted flagger
- Ik wil melding doen als partner
- Ik wil melding doen als merkhouder
Geen klant, autoriteit, trusted flagger, merkhouder of partner? Gebruik dan onderstaande link om melding te doen.