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 moreBasic computational concepts like strings, arrays, stacks, and queuesHow to adapt search algorithms to unusual data structuresThe most efficient algorithms to use in a given situation, and when to apply common-sense heuristic methods

Jeremy Kubica 在 Google 任职首席工程师，着力于机器学习和算法方向。他拥有康奈尔大学的计算机科学本科学位和卡耐基梅隆大学的机器人专业博士学位。在研究生期间，他设计了一个算法，可以探测对地球有威胁的小行星（当然，还尚未能阻止那些小行星）。Kubica 同时也是著名博客Computational Fairy Tales的作者。

关于技术审校者

Heidi Newton 拥有新西兰坎特伯雷大学计算机科学专业的学士学位，以及新西兰惠灵顿维多利亚大学计算机科学专业的硕士学位。她目前就职于坎特伯雷大学计算机专业的代码复仇者研究小组，并在业余时间进行相关辅导和咨询工作。她目前致力于改善关于计算机科学和编程的教学资源。

译者介绍

啊哈磊：原名纪磊，毕业于武汉大学。曾在微软亚洲研究院研发“爬虫”，全国青少年信息学奥林匹克金牌教练。著有《啊哈C语言！逻辑的挑战》和《啊哈！算法》系列编程科普丛书，并被引进至港澳台。

李嘉浩：曾获全国青少年信息学奥林匹克竞赛金牌，国家集训队最小选手。现就读于美国麻省理工学院计算机科学及音乐双专业。喜欢行走在科学与艺术的交接点。