Stock photo: cover may vary
Grokking Algorithms: An Illustrated Guide for Programmers and Other Curious People Paperback - 2016
by Bhargava, Aditya
- Used
- very good
- first
A$30.63
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Standard delivery: 7 to 14 days
Ships from BooksRun (Pennsylvania, United States)
Details
- Title Grokking Algorithms: An Illustrated Guide for Programmers and Other Curious People
- Author Bhargava, Aditya
- Binding Paperback
- Edition First Edition
- Condition Used - Very good
- Pages 256
- Volumes 1
- Language ENG
- Publisher Manning
- Publication date 2016-05
- Illustrated Yes
- Bookseller's Inventory # 1617292230-11-1
- ISBN 9781617292231 / 1617292230
- Weight 0.95 lbs (0.43 kg)
- Dimensions 9.25 x 7.38 x 0.6 in (23.50 x 18.75 x 1.52 cm)
- Category Computers - Languages / Programming
- Library of Congress subjects Computer programming, Computer algorithms
- Library of Congress Catalogue Number 2016285111
- Dewey Decimal Code 005.1
- Quantity available 1
About BooksRun Pennsylvania, United States
Specialising in: Textbooks
Biblio member since 2016
BooksRun - best place to buy, sell or rent cheap textbooks
30 days return guarantee. 10% restocking fee applies to discretionary returns
Summary
Summary Grokking Algorithms is a fully illustrated, friendly guide that
teaches you how to apply common algorithms to the practical problems you
face every day as a programmer. You'll start with sorting and searching
and, as you build up your skills in thinking algorithmically, you'll tackle
more complex concerns such as data compression and artificial intelligence.
Each carefully presented example includes helpful diagrams and fully
annotated code samples in Python. Learning about algorithms doesn't have to
be boring! Get a sneak peek at the fun, illustrated, and friendly examples
you'll find in Grokking Algorithms on Manning Publications' YouTube
channel. Purchase of the print book includes a free eBook in PDF, Kindle,
and ePub formats from Manning Publications. About the Technology An
algorithm is nothing more than a step-by-step procedure for solving a
problem. The algorithms you'll use most often as a programmer have already
been discovered, tested, and proven. If you want to understand them but
refuse to slog through dense multipage proofs, this is the book for you.
This fully illustrated and engaging guide makes it easy to learn how to use
the most important algorithms effectively in your own programs. About the
Book Grokking Algorithms is a friendly take on this core computer science
topic. In it, you'll learn how to apply common algorithms to the practical
programming problems you face every day. You'll start with tasks like
sorting and searching. As you build up your skills, you'll tackle more
complex problems like data compression and artificial intelligence. Each
carefully presented example includes helpful diagrams and fully annotated
code samples in Python. By the end of this book, you will have mastered
widely applicable algorithms as well as how and when to use them. What's
Inside Covers search, sort, and graph algorithms Over 400 pictures with
detailed walkthroughs Performance trade-offs between algorithms Python-
based code samples About the Reader This easy-to-read, picture-heavy
introduction is suitable for self-taught programmers, engineers, or anyone
who wants to brush up on algorithms. About the Author Aditya Bhargava is a
Software Engineer with a dual background in Computer Science and Fine Arts.
He blogs on programming at adit.io. Table of Contents Introduction to
algorithms Selection sort Recursion Quicksort Hash tables Breadth-first
search Dijkstra's algorithm Greedy algorithms Dynamic programming K-nearest
neighbors
Reader reviews for Grokking Algorithms: An Illustrated Guide for Programmers and Other Curious People
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
