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:
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
From the Back Cover
Grokking Algorithms, Second Edition makes it easy to learn. You'll never be bored - complex concepts are all explained through fun cartoons and memorable examples that make them stick. You'll start with tasks like sorting and searching, then build your skills to tackle more advanced problems like data compression and artificial intelligence.
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. By the time you reach the last page, you'll have mastered the most widely applicable algorithms, know when and how to use them, and be fully prepared when you're asked about them on your next job interview.
About the reader
Suitable for self-taught programmers, engineers, job seekers, or anyone who wants to brush up on algorithms.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
paperback. Condición: 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! Nº de ref. del artículo: S_481287967
Cantidad disponible: 1 disponibles
Librería: Dream Books Co., Denver, CO, Estados Unidos de America
Condición: acceptable. This copy has clearly been enjoyedâ"expect noticeable shelf wear and some minor creases to the cover. Binding is strong, and all pages are legible. May contain previous library markings or stamps. Nº de ref. del artículo: DBV.1633438538.A
Cantidad disponible: 1 disponibles
Librería: World of Books (was SecondSale), Montgomery, IL, Estados Unidos de America
Hardback. Condición: 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. Nº de ref. del artículo: CIN1633438538G
Cantidad disponible: 1 disponibles
Librería: World of Books Inc, Montgomery, IL, Estados Unidos de America
Hardback. Condición: 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. Nº de ref. del artículo: CIN1633438538G
Cantidad disponible: 1 disponibles
Librería: Red's Corner LLC, Tucker, GA, Estados Unidos de America
paperback. Condición: 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! Nº de ref. del artículo: RED0XUBWQTQT
Cantidad disponible: 1 disponibles
Librería: BooksRun, Philadelphia, PA, Estados Unidos de America
Paperback. Condición: 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. Nº de ref. del artículo: 1633438538-11-1
Cantidad disponible: 2 disponibles
Librería: INDOO, Avenel, NJ, Estados Unidos de America
Condición: As New. Unread copy in mint condition. Nº de ref. del artículo: SS9781633438538
Cantidad disponible: Más de 20 disponibles
Librería: INDOO, Avenel, NJ, Estados Unidos de America
Condición: New. Brand New. Nº de ref. del artículo: 9781633438538
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 47195113-n
Cantidad disponible: Más de 20 disponibles
Librería: Rarewaves USA, HEBRON, KY, Estados Unidos de America
Hardback. Condición: 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. Nº de ref. del artículo: LU-9781633438538
Cantidad disponible: 10 disponibles