A01=Jeremy Kubica
Age Group_Uncategorized
Age Group_Uncategorized
algorithm
algorithms
Author_Jeremy Kubica
automatic-update
books for 12 year old boys
books for 12 year old girls
books for 13 year old boys
books for 13 year old girls
books for 14 year old boys
books for 14 year old girls
books for teen girls
books for teens
Category1=Non-Fiction
Category=UN
clean code
code
coding
computer
computer science
computer science for kids
computers
COP=United States
cybersecurity
Delivery_Delivery within 10-20 working days
eq_bestseller
eq_computing
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Language_English
nonfiction books for teens
PA=In stock
Price_€20 to €50
PS=Active
security
softlaunch
stem
tech
technology
teen books
teen books for boys
teen girl books
tween books for girls ages 11-14
ya books
young adult
young adult books
Product details
- ISBN 9781593277499
- Dimensions: 152 x 228mm
- Publication Date: 16 Aug 2016
- Publisher: No Starch Press,US
- Publication City/Country: US
- Product Form: Paperback
- Language: English
Secure
checkout
Fast Shipping
Easy returns
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, with a PhD in robotics from Carnegie Mellon University and a B.S. in computer science from Cornell. Kubica is the author of the popular Computational Fairy Tales blog.
