Learning Algorithms
A Programmer's Guide to Writing Better Code
Seiten
2021
O'Reilly Media (Verlag)
978-1-4920-9106-6 (ISBN)
O'Reilly Media (Verlag)
978-1-4920-9106-6 (ISBN)
When it comes to writing efficient code, every software professional needs to have an effective working knowledge of algorithms. In this practical book, author George Heineman (Algorithms in a Nutshell) provides concise and informative descriptions of key algorithms that improve coding. Software developers, testers, and maintainers will discover how algorithms solve computational problems creatively.
Each chapter builds on earlier chapters through eye-catching visuals and a steady rollout of essential concepts, including an algorithm analysis to classify the performance of every algorithm presented in the book. At the end of each chapter, you'll get to apply what you've learned to a novel challenge problem -- simulating the experience you might find in a technical code interview.
With this book, you will:
Examine fundamental algorithms central to computer science and software engineering
Learn common strategies for efficient problem solving -- such as divide and conquer, dynamic programming, and greedy approaches
Analyze code to evaluate time complexity using big O notation
Use existing Python libraries and data structures to solve problems using algorithms
Understand the main steps of important algorithms
Each chapter builds on earlier chapters through eye-catching visuals and a steady rollout of essential concepts, including an algorithm analysis to classify the performance of every algorithm presented in the book. At the end of each chapter, you'll get to apply what you've learned to a novel challenge problem -- simulating the experience you might find in a technical code interview.
With this book, you will:
Examine fundamental algorithms central to computer science and software engineering
Learn common strategies for efficient problem solving -- such as divide and conquer, dynamic programming, and greedy approaches
Analyze code to evaluate time complexity using big O notation
Use existing Python libraries and data structures to solve problems using algorithms
Understand the main steps of important algorithms
George Heineman is a professor of computer science with over twenty years of experience in software engineering and algorithms. He is the author of Algorithms in a Nutshell (2ed) and numerous Safari live training offerings, including Exploring Algorithms in Python and Working with Algorithms in Python.
Erscheinungsdatum | 14.09.2021 |
---|---|
Verlagsort | Sebastopol |
Sprache | englisch |
Maße | 178 x 233 mm |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
ISBN-10 | 1-4920-9106-5 / 1492091065 |
ISBN-13 | 978-1-4920-9106-6 / 9781492091066 |
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