
The CS Detective
An Algorithmic Tale of Crime, Conspiracy, and Computation
No Starch Press · Print & ebook · August 16, 2016
Meet Frank Runtime.
We earn from qualifying purchases.
- Who it’s for
- For computer science students learning search algorithms
- Themes
- Crime investigation, Search algorithms and computation, Conspiracy
- Pacing
- Fast
Nearest books
Matched by what the books are about, then ordered by what their readers also loved.
Blood, Bullets, and BonesBridget Heos51% match
Lazarus MachinePaul Crilley51% match
Gideon Green in Black and WhiteKatie Henry49% match
RunnerCarl Deuker49% match
For older readers: Practical Binary Analysis, How AI Works, Practical SQL, 2nd Edition
Start with three books, and this one can be the first.
Members get a new edition every morning: a route out from their books to essays, research and talks, with the reason for each.
Start with this bookAbout this book
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.
Continue reading
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
Who it’s for
- For computer science students learning search algorithms
- For amateur sleuths who enjoy algorithmic mysteries
Where it sits
| Computers | 59% |
|---|---|
| Programming | 58% |
| Software | 38% |
Percentages are BookFrontier’s reading of the book.
Publisher categories
- Computers
- Programming
- Software
- Authors
- Jeremy Kubica
- Publisher
- No Starch Press
- Published
- August 16, 2016
- Format
- Print & ebook
- Theme
- Crime investigation · Search algorithms and computation · Conspiracy
- Reading lane
- Computers