Python Algorithms

Python Algorithms

4.11 - 1251 ratings - Source

Python Algorithms explains the Python approach to algorithm analysis and design. Written by Magnus Lie Hetland, author of Beginning Python, this book is sharply focused on classical algorithms, but it also gives a solid understanding of fundamental algorithmic problem-solving techniques. The book deals with some of the most important and challenging areas of programming and computer science, but in a highly pedagogic and readable manner. The book covers both algorithmic theory and programming practice, demonstrating how theory is reflected in real Python programs. Well-known algorithms and data structures that are built into the Python language are explained, and the user is shown how to implement and evaluate others himself. What youa€™ll learn Transform new problems to well-known algorithmic problems with efficient solutions, or show that the problems belong to classes of problems thought not to be efficiently solvable. Analyze algorithms and Python programs both using mathematical tools and basic experiments and benchmarks. Prove correctness, optimality, or bounds on approximation error for Python programs and their underlying algorithms. Understand several classical algorithms and data structures in depth, and be able to implement these efficiently in Python. Design and implement new algorithms for new problems, using time-tested design principles and techniques. Speed up implementations, using a plethora of tools for high-performance computing in Python. Who this book is for The book is intended for Python programmers who need to learn about algorithmic problem-solving, or who need a refresher. Students of computer science, or similar programming-related topics, such as bioinformatics, may also find the book to be quite useful. Table of Contents Introduction The Basics Counting 101 Induction and Recursion ... and Reduction Traversal: The Skeleton Key of Algorithmics Divide, Combine, and Conquer Greed Is Good? Prove It! Tangled Dependencies and Memoization From A to B with Edsger and Friends Matchings, Cuts, and Flows Hard Problems and (Limited) SloppinessBefore tackling the full problem, Ia#39;ll guide you through two simpler problems, which are basically special cases ... as much ofwe can of some kind of substance a€”be it edges of a bipartite matching, edge-disjoint paths, or units of flow. ... Youa#39;ll see that the idea of cancelingis keya€”that we may need to remove parts of a previous solution in order to make it ... Note Ia#39;m using the labeling approach due to Ford.

Title:Python Algorithms
Author:Magnus Lie Hetland
Publisher:Apress - 2010-11-24


You Must CONTINUE and create a free account to access unlimited downloads & streaming