Isbn: 9781633438538 - grokking algorithms (22 risultati)

Condizione: good. Paperback Book.

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.

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.

Condizione: As New. Unread copy in mint condition.

Condizione: New. Brand New.

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

Paperback or Softback. Condizione: New. Grokking Algorithms, Second Edition. Book.

Condizione: New.

Hardcover. Condizione: new. Hardcover. 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. A friendly, fully-illustrated introduction to the most important computer programming algorithms. Suitable for self-taught programmers, engineers, job seekers, or anyone who wants to brush up on algorithms. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Paperback. Condizione: USED BOOKS. USED BOOKS ! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.…

Soft cover. Condizione: New. 2nd Edition.

Paperback. Condizione: Good. 2nd Edition. We only honor returns for quality issues and won't accept reasons such as 'change my mind', 'find a better price', or 'school book requirement change', etc.

Condizione: New. 2024. 2nd Edition. paperback. . . . . .

paperback. Condizione: New. Special order direct from the distributor.

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

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

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

Condizione: New.

Condizione: New.

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

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

Taschenbuch. Condizione: 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. …