Enjoy fast, free delivery, exclusive deals, and award-winning movies & TV shows with Prime
Try Prime
and start saving today with fast, free delivery
Amazon Prime includes:
Fast, FREE Delivery is available to Prime members. To join, select "Try Amazon Prime and start saving today with Fast, FREE Delivery" below the Add to Cart button.
Amazon Prime members enjoy:- Cardmembers earn 5% Back at Amazon.com with a Prime Credit Card.
- Unlimited Free Two-Day Delivery
- Streaming of thousands of movies and TV shows with limited ads on Prime Video.
- A Kindle book to borrow for free each month - with no due dates
- Listen to over 2 million songs and hundreds of playlists
- Unlimited photo storage with anywhere access
Important: Your credit card will NOT be charged when you start your free trial or if you cancel during the trial period. If you're happy with Amazon Prime, do nothing. At the end of the free trial, your membership will automatically upgrade to a monthly membership.
Buy new:
$69.99$69.99
FREE delivery:
Thursday, Feb 15
Ships from: Amazon.com Sold by: Amazon.com
Buy used: $45.91
Other Sellers on Amazon
& FREE Shipping
87% positive over last 12 months
Usually ships within 4 to 5 days.
+ $3.99 shipping
90% positive over last 12 months
Usually ships within 4 to 5 days.
+ $3.95 shipping
96% positive over last 12 months
Usually ships within 4 to 5 days.
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Follow the author
OK
Python Algorithms: Mastering Basic Algorithms in the Python Language (Expert's Voice in Open Source) 1st ed. Edition
There is a newer edition of this item:
Purchase options and add-ons
- 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.
About the Author
- ISBN-101430232374
- ISBN-13978-1430232377
- Edition1st ed.
- PublisherApress
- Publication dateNovember 24, 2010
- LanguageEnglish
- Dimensions8.5 x 0.76 x 10.25 inches
- Print length352 pages
Customers who viewed this item also viewed
Product details
- Publisher : Apress; 1st ed. edition (November 24, 2010)
- Language : English
- Paperback : 352 pages
- ISBN-10 : 1430232374
- ISBN-13 : 978-1430232377
- Item Weight : 1.28 pounds
- Dimensions : 8.5 x 0.76 x 10.25 inches
- Best Sellers Rank: #2,541,826 in Books (See Top 100 in Books)
- #2,457 in Python Programming
- #3,317 in Software Development (Books)
- #120,073 in Unknown
- Customer Reviews:
Important information
To report an issue with this product or seller, click here.
About the author

Discover more of the author’s books, see similar authors, read author blogs and more
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on Amazon-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
The algorithms tackled in the book - are not simple / routine ones like sorting/searching - but more higher level ones - like let us say Topological Sorting and its applications and varitations - how to solve a Maze Traversal problem etc.
I found the book very thoughtfully written with good anecdotal references and applications of similar types of algorithms to different problems.
I would have given the book 5*s had I not encountered some places in the book - where the author assumes that the reader probably knows/understands everything - some sections have to be re-read to understand those unclear areas. I think the author uses more pithy sentences rather than more verbose and break out the steps more.
This is a very handy book - where a lot of things can be learnt - if the book is read end to end and read carefully.
also by Apress. So warning: this is not for beginners. Especially if you are
just starting with both Python and algorithms. Experienced algorists would
probably find their way through the book though.
So much for apologies, to use Dijsktra's words. This has been my hardest Apress
so far and second reading is in order. Oh and next time, I won't be skipping
the exercices. I advise you do the same. Some are very necessary if you want to
have a good grasp of all the algorithms covered.
Professor and author Magnus Lie Hetland is an experienced algorist and Python
coder. He promises in Chapter 1 (Introduction) to make you master basic
algorithms with Python and teach you how to create new ones. *cough* I think I
missed that latter part in the book. I only gathered that we can transform few
basic algorithms and apply them to new problems, especially graph algorithms.
It is thus important that you dont skip Chapter 5 (Traversal: The Skeleton Key
of Algorithmics) where I think the basics are found. No really, you don't want
to skip it. And while we are at it, you don't want to skip Chapter 4 (Induction
and Recursion... and Reduction) either. The idea of using reduction when
solving new problems is discussed in full in that chapter.
The last chapter I want to mention is Chapter 11 [Hard Problems and (Limited)
Sloppiness]. Weird but important terms used by experienced algorists are
discussed. I am talking about: solvable, tractable, P, NP, NPC, NP-hard, SAT,
etc...
The chapters I have not mentioned were difficult for me to understand. I wont
say more about them.
You got to like author Lie Hetland for his frankness though. Dijsktra (who gets
chapter 9 entirely dedicated to his graph algorithm) wrote in his preface to A
Discipline of Programming: "For the absence of a bibliography I offer neither
explanation nor apology." Here we have a different author, he writes: "Even so,
I'm sure I have failed in many ways, and if you have suggestions for improving
the book, I'd be happy to hear from you". So can I bitch a little?
The discussion for most algorithms are really visual and that is beautiful...
unless picturing them gets in the way. In chapter 3 (Counting 101) everything
is explained using metaphors. Sums are stories of knights jousting at
tournaments and algorists shaking hands at conferences. The width and the
height of binary trees are the hare and the tortoise. Ice cream cones are used
for doubling and halving processes. Combinations and permutations are stories
of movie goers trying to get tickets.
You quickly get lost in the pictures if like me you are the imaginative type.
So many images, so many stories, in only 25 pages. The whole thing becomes more
a distraction than an actual explanation. I felt that the author sometimes
reduces the reader to hysterical despair with his ability to switch between
stories and metaphors.
I mentioned that I took one algorithm class in college. I remember we were
given formulas, we proved them, and we convinced ourselves that they were
correct. That's it. Don't get me wrong though, Chapter 3 is easily my favorite,
but the pattern repeats itself thorough the book with never ending metaphor
compilations.
All in all, if you are a Python programmer interested in algorithms, this book
is for you. It's a good read. Take your time though, don't rush the reading
like I did and you will learn a lot.
The author berates points in this book that could be explained succinctly, I recently found a web site by a Greek comp-sci undergrad who explains in very plain english how to understand the theoretical computer that every algorithmist uses as a base line.
The author of the web page also explained very simply how to understand Theta, Omega, Big/Little O, tightly bound and loosely bound and so on.
There is a prevalent myth floating around in the world that certain mathematical formulas, scientific concepts and statistical theories are just too esoteric and abstract to explain in real plain english. From reading Magnus book I would say that he is one of those people who chooses to continue to perpetuate that myth.
I would post the link to the website but Amazon deletes web links. But search for a 'gentle introduction to algorithm complexity' and you should find it. The author of that website has a talent to explain technical concepts succinctly and understandbely, you only have to bring some programing background and motivation to understand it.
By contrast in order to read and comprehend this book you have to bring an exposure to and a fetish for theory, indeed a fetish.
I cant imagine what practical Python programmer or any programmer this book is geared for.
I dare say that even for an advanced comp-sci majors this book will become boring very quickly either because it covers everything you *should* already know or you just want to get down to programming.
Where the author could have used plain english and expanded on practical technical concepts the author instead chose to indulge in abstracting theory. A missed opportunity to bring knowledge to a larger audience, instead the author indulges in the theatrics of dedicating a whole book to complicating things.
I doubt the Second Edition is any more readable.




