ISBN: 9781633438538 - grokking algorithms (13 Ergebnisse)

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

Hardback. Zustand: 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.…

Paperback. Zustand: 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.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Zustand: Very 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, youll actually enjoy learning these important algorithms. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.…

Zustand: New.

Zustand: New. In English.

Paperback. Zustand: Brand New. 2nd edition. 289 pages. 9.25x7.37x0.72 inches. In Stock.

Paperback. Zustand: Brand New. 2nd edition. 289 pages. 9.25x7.37x0.72 inches. In Stock.

Zustand: New. 2024. 2nd Edition. paperback. . . . . . Books ship from the US and Ireland.

Paperback. Zustand: Brand New. 2nd edition. 289 pages. 9.25x7.37x0.72 inches. In Stock.

Zustand: NEW.

Buch. Zustand: Neu. Neuware - 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.…