Python Algorithms: Mastering Basic Algorithms in the Pyth... und über 1,5 Millionen weitere Bücher verfügbar für Amazon Kindle. Erfahren Sie mehr

Loggen Sie sich ein, um 1-Click® einzuschalten.
Mit kostenloser Probeteilnahme bei Amazon Prime. Melden Sie sich während des Bestellvorgangs an.
Jetzt eintauschen
und EUR 3,00 Gutschein erhalten
Alle Angebote
Möchten Sie verkaufen? Hier verkaufen
Der Artikel ist in folgender Variante leider nicht verfügbar
Keine Abbildung vorhanden für
Keine Abbildung vorhanden

Beginnen Sie mit dem Lesen von Python Algorithms auf Ihrem Kindle in weniger als einer Minute.

Sie haben keinen Kindle? Hier kaufen oder eine gratis Kindle Lese-App herunterladen.

Python Algorithms: Mastering Basic Algorithms in the Python Language (Expert's Voice in Open Source) [Englisch] [Taschenbuch]

Magnus Lie Hetland

Preis: EUR 40,90 kostenlose Lieferung. Siehe Details.
  Alle Preisangaben inkl. MwSt.
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Auf Lager.
Verkauf und Versand durch Amazon. Geschenkverpackung verfügbar.
Lieferung bis Montag, 22. September: Wählen Sie an der Kasse Morning-Express. Siehe Details.

Weitere Ausgaben

Amazon-Preis Neu ab Gebraucht ab
Kindle Edition EUR 21,96  
Taschenbuch EUR 40,90  


25. November 2010 1430232374 978-1430232377 2010
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 you'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.

Kunden, die diesen Artikel angesehen haben, haben auch angesehen


Mehr über den Autor

Entdecken Sie Bücher, lesen Sie über Autoren und mehr


Über den Autor und weitere Mitwirkende

Magnus Lie Hetland is an associate professor of algorithms at the Norwegian University of Science and Technology, NTNU. Even though he loves learning new programming languages-even quite obscure ones-Magnus has been a devoted Python fan and an active member of the Python community for many years, and is the author of the popular online tutorials "Instant Python" and "Instant Hacking" His has written publications including Practical Python and Beginning Python, as well as several scientific papers. When he isn't busy staring at a computer screen, he may be found reading (even while bicycling) acting (in a local theater group) or gaming (mostly role-playing games)

In diesem Buch (Mehr dazu)
Ausgewählte Seiten ansehen
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis
Hier reinlesen und suchen:


Es gibt noch keine Kundenrezensionen auf
5 Sterne
4 Sterne
3 Sterne
2 Sterne
1 Sterne
Die hilfreichsten Kundenrezensionen auf (beta) 3.6 von 5 Sternen  11 Rezensionen
31 von 32 Kunden fanden die folgende Rezension hilfreich
4.0 von 5 Sternen Very good explanation of basic algorithms 13. Dezember 2010
Von Robert Hancock - Veröffentlicht auf
Format:Taschenbuch|Verifizierter Kauf
- Very clear explanation of a complex subject.
- Each chapter builds upon the previous chapters so that this is more like a class than a reference manual.
- More approachable that the Sedgewick and Cormen.

- The almost constant parenthetical phrases distract from the text and quickly become irritating. After page 20 I just skipped them and found that I understood the concepts more quickly.
- The use of single letter variables in the code examples makes it more difficult to understand the structure of a new concept. When there are several of them, it can become confusing. (See page 207.) Why not just use descriptive variable names?

There are sections that make note of how to implement certain algorithms using Python specific features, and this is very helpful, but this is first and foremost a book on algorithmic theory that happens to use Python for code examples.
8 von 9 Kunden fanden die folgende Rezension hilfreich
5.0 von 5 Sternen Instructive and Entertaining 5. Januar 2011
Von Mike - Veröffentlicht auf
I found Python Algorithms not only extremely helpful but an enjoyable read as well, not an easy task for an algorithm book. The text is conversational and well-organized, with numerous side notes that allow the reader to make insightful connections. The author's use of humor is not overwhelming, nor is it so sparse as to confuse novice readers to his intent. His use of sidebars can bog down the topics at times, but this has the advantage of making this text appropriate for readers of all skill levels.

The author also takes great pains to explain Python code within the book, which not only models well-written code to the reader but also takes advantage of eliminating pseudo-code with concrete examples of the Python language. The use of citations and notes on external sources within the book made it possible for me to independently research topics on the web. For more hands-on learners, there are exercises at the end of each chapter. This text could easily be the basis for a college-level class on Python and algorithm theory/development. All in all, a great text and a must-have for the Python programmer!
15 von 19 Kunden fanden die folgende Rezension hilfreich
3.0 von 5 Sternen It's okay but too chatty. 24. März 2011
Von Ian Zimmerman - Veröffentlicht auf
This book presents a quite broad range of fundamental computer science
algorithms, with all illustrative code written in Python. There is a
strong emphasis on graph algorithms, perhaps reflecting a predilection
of the author. Since I like graphs too I cannot complain about that.

Beyond the actual implementations, the book aims for extra Python
relevance by including asides on Python internals (CPython, to be
precise). I was pleasantly surprised by the ones included, as they go
beyond the trivial. Given the prevalence of graph algorithms heaps (or
priority queues) had to play a central role, and the aside on Python's
heapq module is perhaps the most important of them. I wish there were
more of the Pythonic asides, though.

Even so, the book makes clear how Python's carefully balanced design
enables beautiful, concise implementations. There is almost no low
level busy-work code, the algorithms practically read themselves. And
they are commented too just in case you find a piece difficult to

There's more to algorithms then the implementations, though: one has to
address correctness proofs and efficiency properties. The book
certainly doesn't neglect these, but if there's one clear downside (for
this reader) it is this: too much English, too few symbols. The author
goes to great lengths to use informal language instead of "math" when
discussing correctness and efficiency, and in the end I think he
overdoes it. Here's an example from Chapter 7, on greedy algorithms,
discussing the scheduling problem with hard deadlines, discrete time
and tasks of equal length:

"The last question then becomes, does S' have the same profit as S?
And indeed it does, because the T' cannot have a greater profit than T!
We can prove this by contradiction, based on our greed: if T' has a
greater profit, we would have considered it before T, necessarily
scheduling it somewhere else. (It would have been scheduled, because
there was at least one free slot before its deadline.) But we assumed
that we could extend P to S, and if it has a task in a different
position, we have a contradiction."

Perhaps it's just me (I have a math background) but if I were writing
code to run a nuclear power station I would not be comfortable with
proofs in this style.

I also think this might be a consequence of a more general attribute of
the book, namely its tendency to banter. Phrases like "Cool, no?" or
"This might hurt your brain" are numerous to the point of distracting -
again, for this reader, perhaps not so much for someone younger or with
a different background.

There are many exercises, with hints for solutions in an appendix. Each
chapter ends with an "If You're Curious" section which points you to the
relevant reference items in the bibliography and to some topics related
to, but deeper than, those discussed in the chapter. Some parts of the
text are set in a slightly larger and bolder font, with white titles on
black background. The purpose of this typographic device is not clear.
Maybe they are intended as general asides, but in some cases there are
back references to them later in the main text. In a technical book
this kind of thing is usually explained in the introduction, but not
here. Finally, as a fan I greatly appreciated the xkcd comic strips
included when relevant.

All in all, the book does a large part of what I expected of it. I
would recommend it most of all to someone already familiar with most of
the algorithms but not very familiar with Python, as a very good example
of Python's power. It can also work as a general introduction to the
algorithms, just be prepared to reach for the references in some cases
to clarify and expand your view.
3 von 3 Kunden fanden die folgende Rezension hilfreich
2.0 von 5 Sternen way, way too verbose, and then skips the real point 7. Mai 2012
Von peluk - Veröffentlicht auf
Format:Taschenbuch|Verifizierter Kauf
This is probably the most verbose book in Computer Science I have ever read. What annoyed me about the writing style is that the book keeps talking and talking and going around the point, but when it finally shows how to implement the algorithm in Python, it does not explain the code at all. You have to figure that out on your own. I wish the author just went straight to the point and explain the algorithm in a concise and the code implementing it. In the end I always ended up looking up online how to implement the algorithms in Python, because the book does not spend any time explaining the Python code. I am going to buy 'Data Structures and Algorithms Using Python'. I hope that one is better.
7 von 9 Kunden fanden die folgende Rezension hilfreich
5.0 von 5 Sternen For Intermediate Python Programmers Who Want to Master Basic Algorithms 21. Januar 2011
Von K. Noagbodji - Veröffentlicht auf
Python Algorithms is of the same level as the book Pro Python by Marty Alchin,
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,

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

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.
Waren diese Rezensionen hilfreich?   Wir wollen von Ihnen hören.

Kunden diskutieren

Das Forum zu diesem Produkt
Diskussion Antworten Jüngster Beitrag
Noch keine Diskussionen

Fragen stellen, Meinungen austauschen, Einblicke gewinnen
Neue Diskussion starten
Erster Beitrag:
Eingabe des Log-ins

Kundendiskussionen durchsuchen
Alle Amazon-Diskussionen durchsuchen

Ähnliche Artikel finden

Ihr Kommentar