- 本カテゴリの商品を2500円以上購入で買取金額500円UPキャンペーン対象商品です。商品出荷時に買取サービスでご利用いただけるクーポンをメールにてご案内させていただきます。 詳細はこちら (細則もこちらからご覧いただけます)
The CS Detective: An Algorithmic Tale of Crime, Conspiracy, and Computation (英語) ペーパーバック – 2016/8/16
Kindle 端末は必要ありません。無料 Kindle アプリのいずれかをダウンロードすると、スマートフォン、タブレットPCで Kindle 本をお読みいただけます。
Meet Frank Runtime. Disgraced ex-detective. Hard-boiled private eye. Search expert.
When a robbery hits police headquarters, it’s up to Frank Runtime and his extensive search skills to catch the culprits. In this detective story, you’ll learn how to use algorithmic tools to solve the case. Runtime scours smugglers’ boats with binary search, tails spies with a search tree, escapes a prison with depth-first search, and picks locks with priority queues. Joined by know-it-all rookie Officer Notation and inept tag-along Socks, he follows a series of leads in a best-first search that unravels a deep conspiracy. Each chapter introduces a thrilling twist matched with a new algorithmic concept, ending with a technical recap.
Perfect for computer science students and amateur sleuths alike, The CS Detective adds an entertaining twist to learning algorithms.
Follow Frank’s mission and learn:
–The algorithms behind best-first and depth-first search, iterative deepening, parallelizing, binary search, and more
–Basic computational concepts like strings, arrays, stacks, and queues
–How to adapt search algorithms to unusual data structures
–The most efficient algorithms to use in a given situation, and when to apply common-sense heuristic methods
Jeremy Kubica is a principal engineer at Google working on machine learning and algorithms. He has a PhD in robotics from Carnegie Mellon University and a BS in computer science from Cornell University. Kubica is the author of the popular Computational Fairy Tales blog.
The analogies while introducing the algorithms are very well thought out. I like the actual maze for back tracking and the array cart for transporting animals. There are fun references sprinkled throughout like the Brazen Booleans – want to guess that type of answers they give? And the Port of USB. There were also some references that are nice for parents reading this with a child (Intro to Turtle Graphics). The detective meets some fun characters like a wizard.
While I knew most of what was in the book, I hadn't learned (or had forgotten) about iterative deepening so I learned something new.
I read this book so I could recommend it to teenagers starting out with algorithms. It definitely fit the bill. I think adults would enjoy it as well. It's like Head First – fun to read and easy to retain the info. Then there's the interest to go read a harder book. The first half of this book is provided online by the publisher so you can decide for yourself if you like the style.
Disclosure: I received a review copy of this book from the publisher for reviewing it on behalf of CodeRanch.