Grokking Algorithms

4.42 ( 4,409 Ratings by Goodreads)
Grokking Algorithms

Grokking Algorithms

4.42 (4,409 Ratings by Goodreads)
paperback
Published: 14 March, 2024
Standard worldwide delivery by Mon, June 22 - Thu, June 25
Order within 0
Condition: NEW
$47.26
RRP $52.36
You save $5.10 (10%)
Price includes shipping
Available 4 in stock
- +
FREE Returns within 30 days

Description

A friendly, fully-illustrated introduction to the most important computer programming algorithms.

The algorithms you'll use most often as a programmer have already been discovered, tested, and proven. This book will prepare you for those pesky algorithms questions in every programming job interview and help you apply them in your day-to-day work. And if you want to understand them without slogging through dense multipage proofs, this is the book for you.

In Grokking Algorithms, Second Edition you will discover:

  • Search, sort, and graph algorithms
  • Data structures such as arrays, lists, hash tables, trees, and graphs
  • NP complete and greedy algorithms
  • Performance trade-offs between algorithms
  • Exercises and code samples in every chapter
  • Over 400 illustrations with detailed walkthroughs

The first edition of Grokking Algorithms proved to over 100,000 readers that learning algorithms doesn't have to be complicated or boring! This new edition now includes fresh coverage of trees, NP complete problems, and code updates to Python 3. With easy-to-read, friendly explanations, clever examples, and exercises to sharpen your skills as you learn, you’ll actually enjoy learning these important algorithms.

See more

More Details

Type Book
ISBN13 9781633438538
ISBN10 1633438538
Number Of Pages 320
Item Weight 599 g
Product Dimensions 190 x 235 x 20 mm
Publisher / Reseller Manning Publications
Format paperback
Edition 2nd edition
See More +

GoodReads Reviews

Author's Bio

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.

Show more