Articoli correlati a Grokking Algorithms
Sinossi
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:
- 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.
Purchase of the print book includes a free eBook in PDF and ePub formats from Manning Publications.
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
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sull'autore
Aditya Bhargava is a Software Engineer with a dual background in Computer Science and Fine Arts. He blogs on programming at adit.io.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Grokking Algorithms
Immagini fornite dal venditore
Grokking Algorithms, Second Edition: An illustrated guide for programmers and other curious people
Da: Goodwill Southern California, Los Angeles, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: good. Paperback Book. Codice articolo LACV.1633438538.G
Compra usato
EUR 34,62
Spedizione EUR 2,68
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Grokking Algorithms
Editore:
Manning Publications, 2024
ISBN 10: 1633438538
ISBN 13: 9781633438538
Antico o usato
Rilegato
Da: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: Good. 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 algorithmsData structures such as arrays, lists, hash tables, trees, and graphsNP complete and greedy algorithmsPerformance trade-offs between algorithmsExercises and code samples in every chapterOver 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. Codice articolo CIN1633438538G
Compra usato
EUR 37,37
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Grokking Algorithms, Second Edition
Da: HPB-Red, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
paperback. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Codice articolo S_484123233
Compra usato
EUR 35,32
Spedizione EUR 3,35
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Grokking Algorithms
Editore:
Manning Publications, 2024
ISBN 10: 1633438538
ISBN 13: 9781633438538
Antico o usato
Rilegato
Da: World of Books Inc, Montgomery, IL, U.S.A.
Valutazione del venditore 4 su 5 stelle
Hardback. Condizione: Good. 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 algorithmsData structures such as arrays, lists, hash tables, trees, and graphsNP complete and greedy algorithmsPerformance trade-offs between algorithmsExercises and code samples in every chapterOver 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. Codice articolo CIN1633438538G
Compra usato
EUR 39,23
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Grokking Algorithms, Second Edition: An illustrated guide for programmers and other curious people
Editore:
Manning (edition 2nd), 2024
ISBN 10: 1633438538
ISBN 13: 9781633438538
Antico o usato
Paperback
Da: BooksRun, Philadelphia, PA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Very Good. 2nd. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting. Codice articolo 1633438538-11-1
Compra usato
EUR 41,20
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 2 disponibili
Foto dell'editore
Grokking Algorithms, Second Edition Format: Paperback
Editore:
Simon and Schuster, 2024
ISBN 10: 1633438538
ISBN 13: 9781633438538
Antico o usato
Brossura
Da: INDOO, Avenel, NJ, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread copy in mint condition. Codice articolo SS9781633438538
Compra usato
EUR 41,51
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Grokking Algorithms, Second Edition Format: Paperback
Da: INDOO, Avenel, NJ, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Brand New. Codice articolo 9781633438538
Compra nuovo
EUR 41,61
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Grokking Algorithms
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 47195113-n
Compra nuovo
EUR 43,13
Spedizione EUR 2,36
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Grokking Algorithms
Da: Rarewaves USA, HEBRON, KY, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: New. 2nd. 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 algorithmsData structures such as arrays, lists, hash tables, trees, and graphsNP complete and greedy algorithmsPerformance trade-offs between algorithmsExercises and code samples in every chapterOver 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. Codice articolo LU-9781633438538
Compra nuovo
EUR 45,56
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 10 disponibili
Foto dell'editore
Grokking algorithms
Editore:
Manning Publications Co, 2024
ISBN 10: 1633438538
ISBN 13: 9781633438538
Antico o usato
paperback
Da: Red's Corner LLC, Tucker, GA, U.S.A.
Valutazione del venditore 5 su 5 stelle
paperback. Condizione: Good. 2. 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! Codice articolo RED0XUBWQTQT
Compra usato
EUR 44,30
Spedizione EUR 3,57
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili