LEADER 03403nam 22005175 450 001 9911034866003321 005 20251016173422.0 010 $a979-88-6881-799-1 024 7 $a10.1007/979-8-8688-1799-1 035 $a(MiAaPQ)EBC32345834 035 $a(Au-PeEL)EBL32345834 035 $a(CKB)41640998400041 035 $a(CaSebORM)9798868817991 035 $a(OCoLC)1545644239 035 $a(OCoLC-P)1545644239 035 $a(DE-He213)979-8-8688-1799-1 035 $a(EXLCZ)9941640998400041 100 $a20251014d2025 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aMastering Algorithms with Python $eA Practical Approach to Problem Solving and Python Implementation /$fby Chenyang Shi 205 $a1st ed. 2025. 210 1$aBerkeley, CA :$cApress :$cImprint: Apress,$d2025. 215 $a1 online resource (228 pages) 225 1 $aProfessional and Applied Computing Series 300 $aDescription based upon print version of record. 311 08$a979-88-6881-798-4 327 $aChapter 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. 330 $aGain a solid understanding of algorithms and improve your problem-solving abilities using Python code. With practical examples and clear explanations, this book bridges the gap between dense academic texts and overly simple industry guides. 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. 410 0$aProfessional and Applied Computing Series 606 $aDistributed algorithms 606 $aPython (Computer program language) 615 0$aDistributed algorithms. 615 0$aPython (Computer program language) 676 $a005.13 700 $aShi$b Chenyang$01852828 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9911034866003321 996 $aMastering Algorithms with Python$94448705 997 $aUNINA