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:
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
US$ 3.99 shipping within U.S.A.
Destination, rates & speedsSeller: Bookmans, Tucson, AZ, U.S.A.
paperback. Condition: Good. . Satisfaction 100% guaranteed. Seller Inventory # mon0002689948
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 47195113-n
Quantity: Over 20 available
Seller: INDOO, Avenel, NJ, U.S.A.
Condition: New. Seller Inventory # 9781633438538
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 47195113
Quantity: Over 20 available
Seller: INDOO, Avenel, NJ, U.S.A.
Condition: As New. Unread copy in mint condition. Seller Inventory # SS9781633438538
Quantity: Over 20 available
Seller: BestAroundDeals, Grand Rapids, MI, U.S.A.
Soft cover. Condition: New. 2nd Edition. Seller Inventory # ABE-1742748677508
Quantity: 3 available
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condition: New. Grokking Algorithms, Second Edition 1.2. Book. Seller Inventory # BBS-9781633438538
Quantity: 5 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # PB-9781633438538
Quantity: 15 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9781633438538
Quantity: Over 20 available
Seller: Rarewaves USA, OSWEGO, IL, U.S.A.
Hardback. Condition: 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. Seller Inventory # LU-9781633438538
Quantity: 10 available