Grokking algorithms

Contributor(s):

Bhargava, Aditya Y [Autor]

Material type: Text

TextLanguage: English Publication details: Shelter Island, NY Manning Publications Co., 2016Description: xviii, 238 pages : illustrations ; 24 cmISBN:

9781617292231

Subject(s):

Contents:

Chapter 1. Introduction to Algorithms Chapter 2. Selection Sort-- Chapter 3. Recursion-- Chapter 4. Quicksort-- Chapter 5. Hash Tables-- Chapter 6. Breadth-first Search-- Chapter 7. Dijkstra's algorithm-- Chapter 8. Greedy algorithms-- Chapter 9. Dynamic programming-- Chapter 10. K-nearest neighbors-- Chapter 11. Where to go next-- Appendix. Answers to Exercises-- Index--

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. 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. 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.

Holdings ( 2 )
Title notes ( 2 )

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Book	TBS Barcelona Libre acceso	QA76.9.A43 BHA (Browse shelf(Opens below))	Available		B04115
Book	TBS Barcelona Libre acceso	QA76.9.A43 BHA (Browse shelf(Opens below))	Available		B04116

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. 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. 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.