Python Algorithms: Mastering Basic Algorithms in the Python Language

av Magnus Lie Hetland  (häftad, 2010)

Pris:  612:-
Skickas inom 2-5 vardagar.
Fri frakt inom Sverige för privatpersoner vid beställning på minst 99 kr!


Bli först att betygsätta och recensera boken Python Algorithms: Mastering Basic Algorithms in the Python Language.

Python Algorithms: Mastering Basic Algorithms in the Python Language (häftad)
Fler böcker inom
  • Häftad (paperback)
  • Språk: Engelska
  • Antal sidor: 336
  • Utg.datum: 2010-12-10
  • Illustrationer: illustrations
  • Dimensioner: 241 x 190 x 12 mm
  • Vikt: 476 g
  • Antal komponenter: 1
  • Komponenter: 3:B&W 7.5 x 9.25 in or 235 x 191 mm Perfect Bound on White w/Gloss Lam
  • ISBN: 9781430232377

Fler böcker av Magnus Lie Hetland

  • Python Algorithms

    Magnus Lie Hetland

    Python Algorithms, Second Edition 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 understandi...

  • Beginning Python: From Novice to Professional

    Magnus Lie Hetland

    Gain a fundamental understanding of Python's syntax and features with the second edition of Beginning Python , an up-to-date introduction and practical reference. Covering a wide array of Python-related programming topics, including addressing lan...

Bloggat om Python Algorithms: Mastering Basic Algorithms in the...

Övrig information

Magnus Lie Hetland is an experienced Python programmer, having used the language since the late 1990s. He is also an associate professor of algorithms at the Norwegian University of Science and Technology, having taught algorithms for the better part of a decade. Hetland is the author of Practical Python and Beginning Python, first and second editions, as well as several scientific papers.


* 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) Sloppiness