- View more resources from this publisher
No Starch Press
CS detective: an algorithmic tale of crime, conspiracy, and computation
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, readers will 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, parallelising, 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.
Show health and safety information
Please be aware that resources have been published on the website in the form that they were originally supplied. This means that procedures reflect general practice and standards applicable at the time resources were produced and cannot be assumed to be acceptable today. Website users are fully responsible for ensuring that any activity, including practical work, which they carry out is in accordance with current regulations related to health and safety and that an appropriate risk assessment has been carried out.
