Grokking Algorithms
Seiten
2024
|
2nd edition
Manning Publications (Verlag)
978-1-63343-853-8 (ISBN)
Manning Publications (Verlag)
978-1-63343-853-8 (ISBN)
- Lieferbar (Termin unbekannt)
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
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.
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.
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.
About the Author Aditya Bhargava is a Software Engineer with a dual background in Computer Science and Fine Arts. He blogs on programming at adit.io.
| Erscheinungsdatum | 24.02.2024 |
|---|---|
| Zusatzinfo | Illustrations |
| Verlagsort | New York |
| Sprache | englisch |
| Maße | 190 x 235 mm |
| Gewicht | 599 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
| Informatik ► Theorie / Studium ► Algorithmen | |
| Wirtschaft ► Betriebswirtschaft / Management ► Projektmanagement | |
| ISBN-10 | 1-63343-853-8 / 1633438538 |
| ISBN-13 | 978-1-63343-853-8 / 9781633438538 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media
Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …
Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15
Eine Einführung mit Java
Buch | Hardcover (2020)
dpunkt (Verlag)
CHF 62,85
