"Search" transforms the essential but challenging topic of search algorithms into a fantasy-noir mystery for the digital age. This is a unique introduction to search algorithms and how they work, written by a Google engineer with specializations in algorithms and machine learning.Meet Frank Runtime. Disgraced ex-detective. Hard-boiled private eye. Search expert. When the police headquarters is hit with a robbery, Frank and his extensive search skills are called upon to catch the culprits. Pulling out his best algorithms, Frank scours smugglers' boats with binary search, tails spies with a search tree, escapes burning prisons with breadth-first search, and burns down cafeterias with queues. He's joined by know-it-all rookie Officer Notation and Socks the inept wizard as he follows leads in a best-first search that unravels a deep conspiracy. Each chapter introduces a new twist and a new concept, ending with a technical summary.From finding informants with exhaustive search to lock-picking with priority queues, Frank's mission will give you an understanding of: The algorithms behind best-first and depth-first search, iterative deepening, parallelizing, binary search, index inversion, and moreBasic computational concepts like strings, arrays, stacks, and queues How to adapt search algorithms to unusual data structuresThe most efficient algorithm to use in a situation, and when to apply common-sense heuristic methodsFor computer science students and amateur sleuths alike, "Search" is the most efficient route to understanding algorithms.
Product code: AUNBT
Publisher: No Starch Press,US
Dimensions: 20.6cm x 23.0cm
Publish date: 31/07/2016
Help our customers make the best choices by telling everyone what you think about this product.
There are currently no customer reviews for this product. Why not be the first?