Grokking algorithms
5,652 ratings by Goodreads
Language: English
Published by Manning Publications Co, 2024
- Softcover
- Used
Seller: Red's Corner LLC, Tucker, GA, U.S.A.Red's Corner LLC
5-star seller
AbeBooks seller since March 26, 2018
Softcover
Condition: Used - Good
US$ 36.95
US$ 4.00 shipping
Ships within U.S.A.
Quantity: 1 available
Add to basketFree 30-day returns
Item description from seller
Grade 2 out 5 points. Used books with this grade may have any of the following: Moderate wear on cover and pages, personalized notes/names, stickers/labels, markings on pages, bends/creases on cover/spine, ex-library markings. May not include extra materials such as dust jackets, access codes, CDs, accessories, etc. All orders ship by next business day! We are a small company and very thankful for your business.
Seller Inventory # RED0XUBWQTQT
- Title
- Grokking algorithms
- Author
- Bhargava, Aditya Y.
- Publisher
- Manning Publications Co
- Publication year
- 2024
- Condition
- Good
- Binding
- paperback
- Language
- English
- ISBN 10
- 1633438538
- ISBN 13
- 9781633438538
- Edition
- 2.
A friendly, fully-illustrated introduction to the most important computer programming algorithms.
Master the most widely used algorithms and be fully prepared when you’re asked about them at your next job interview. With beautifully simple explanations, over 400 fun illustrations, and dozens of relevant examples, you’ll actually enjoy learning about algorithms with this fun and friendly guide!
In Grokking Algorithms, Second Edition you will discover:
The first edition of Grokking Algorithms proved to over 100,000 readers that learning algorithms doesn't have to be complicated or boring! This revised second edition contains brand new coverage of trees, including binary search trees, balanced trees, B-trees and more. You’ll also discover fresh insights on data structure performance that takes account of modern CPUs. Plus, the book’s fully annotated code samples have been updated to Python 3.
Foreword by Daniel Zingaro.
About the technology
The algorithms you use most often have already been discovered, tested, and proven. Grokking Algorithms, Second Edition makes it a breeze to learn, understand, and use them. With beautifully simple explanations, over 400 fun illustrations, and dozens of relevant examples, it’s the perfect way to unlock the power of algorithms in your everyday work and prepare for your next coding interview—no math required!
About the book
Grokking Algorithms, Second Edition teaches you important algorithms to speed up your programs, simplify your code, and solve common programming problems. Start with tasks like sorting and searching, then build your skills to tackle advanced problems like data compression and artificial intelligence. You’ll even learn to compare the performance tradeoffs between algorithms. Plus, this new edition includes fresh coverage of trees, NP-complete problems, and code updates to Python 3.
What's inside
About the reader
No advanced math or programming skills required.
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
1 Introduction to algorithms
2 Selection sort
3 Recursion
4 Quicksort
5 Hash tables
6 Beadth-first search
7 Trees
8 Balanced trees
9 Dijkstra’s algorithm
10 Greedy algorithms
11 Dynamic programming
12 k-nearest neighbors
13 where to go next
Master the most widely used algorithms and be fully prepared when you’re asked about them at your next job interview. With beautifully simple explanations, over 400 fun illustrations, and dozens of relevant examples, you’ll actually enjoy learning about algorithms with this fun and friendly guide!
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 revised second edition contains brand new coverage of trees, including binary search trees, balanced trees, B-trees and more. You’ll also discover fresh insights on data structure performance that takes account of modern CPUs. Plus, the book’s fully annotated code samples have been updated to Python 3.
Foreword by Daniel Zingaro.
About the technology
The algorithms you use most often have already been discovered, tested, and proven. Grokking Algorithms, Second Edition makes it a breeze to learn, understand, and use them. With beautifully simple explanations, over 400 fun illustrations, and dozens of relevant examples, it’s the perfect way to unlock the power of algorithms in your everyday work and prepare for your next coding interview—no math required!
About the book
Grokking Algorithms, Second Edition teaches you important algorithms to speed up your programs, simplify your code, and solve common programming problems. Start with tasks like sorting and searching, then build your skills to tackle advanced problems like data compression and artificial intelligence. You’ll even learn to compare the performance tradeoffs between algorithms. Plus, this new edition includes fresh coverage of trees, NP-complete problems, and code updates to Python 3.
What's inside
- Search, sort, and graph algorithms
- Data structures such as arrays, lists, hash tables, trees, and graphs
- NP-complete and greedy algorithms
- Exercises and code samples in every chapter
About the reader
No advanced math or programming skills required.
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
1 Introduction to algorithms
2 Selection sort
3 Recursion
4 Quicksort
5 Hash tables
6 Beadth-first search
7 Trees
8 Balanced trees
9 Dijkstra’s algorithm
10 Greedy algorithms
11 Dynamic programming
12 k-nearest neighbors
13 where to go next
"Synopsis" may belong to another edition of this title.
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.
"About the title" may belong to another edition of this title.
Red's Corner LLC
Tucker, GA, U.S.A.
5-star seller
AbeBooks seller since March 26, 2018
Shipping rates within U.S.A.
| Item | 4 to 8 business days | 2 to 5 business days |
|---|---|---|
| First item | US$ 4.00 | US$ 15.00 |
Payment methods
Store description
We have a small storefront in Tucker GA. Open M-F, 8a-4p.
Specialty
AllSeller's business information
Red's Corner LLC
GA, U.S.A.