Mastering Algorithms with Python
Apress (Verlag)
979-8-8688-1798-4 (ISBN)
Focusing on the logic behind essential algorithms such as Breadth First Search (BFS), Depth First Search (DFS), Divide-and-Conquer, Greedy Methods, and Dynamic Programming, the book provides ample examples, from easy to more advanced. By connecting these concepts to real-world examples, such as chess strategies and the Seam Carving, the book helps readers better grasp and apply algorithms. Each chapter also includes fully implemented Python code, making it a practical reference.
Mastering Algorithms with Python is ideal for IT professionals looking to enhance their skills and approach algorithms with clarity and confidence.
What You Will Learn
· Understand foundational algorithms such as BFS, DFS, Divide-and-Conquer, Greedy Methods, Dynamic Programming through practical examples
· Implement algorithms in Python with step-by-step guidance and fully functional code for future reference
· Build a solid foundation in advanced concepts such as Minimum Spanning Trees, Fast Fourier Transform, and Monte Carlo Tree Search
· Quickly review Python essentials, including data types, flow control, generators, decorators, and classes to enhance your algorithmic understanding
Who This Book Is For
Software developers, data scientists, machine learning professionals and any curious learners about computer algorithms.
Chenyang Shi is a Data Science manager at a leading consulting firm, specializing in applying machine learning and data science to enhance marketing and commercialization forecasting for major pharmaceutical clients. He earned his Ph.D. from Department of Applied Physics and Applied Mathematics at Columbia University (2015) and a Master’s in Computer Science with a focus on Machine Learning from Georgia Institute of Technology (2020). With over a decade of Python programming experience, Chenyang is the lead author of two peer-reviewed software programs, JRgui (published at ACS Omega) and xINTERPDF (Journal of Applied Crystallography), comprising over 7,500 lines of Python code.
Chapter 1: Recursion.- Chapter 2: Divide and Conquer.- Chapter 3: Greedy Algorithm.- Chapter 4: Dynamic Programming.- Chapter 5: RSA Cryptosystem.- Chapter 6: Monte Carlo.- Chapter 7: A Tale of Ten Cities.- Chapter 8: Chess.- Appendix: A Quick Review of Python.- Appendix B: Environment Setup and Package Installation.- Appendix C: References.
| Erscheinungsdatum | 14.10.2025 |
|---|---|
| Zusatzinfo | 281 Illustrations, color; 30 Illustrations, black and white |
| Verlagsort | Berkley |
| Sprache | englisch |
| Maße | 178 x 254 mm |
| Themenwelt | Informatik ► Programmiersprachen / -werkzeuge ► Python |
| Informatik ► Theorie / Studium ► Algorithmen | |
| Schlagworte | algorithms • Boolean Logic and Flow Control • Dynamic Programming • Python • RSA cryptosystem |
| ISBN-13 | 979-8-8688-1798-4 / 9798868817984 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
