{"product_id":"the-cs-detective-isbn-9781593277499","title":"The CS Detective","description":"Meet Frank Runtime. Disgraced ex-detective. Hard-boiled private eye. Search expert.\u003cbr\u003e\u003cbr\u003eWhen 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.\u003cbr\u003e\u003cbr\u003ePerfect for computer science students and amateur sleuths alike, \u003ci\u003eThe CS Detective\u003c\/i\u003e adds an entertaining twist to learning algorithms.\u003cbr\u003e\u003cbr\u003eFollow Frank’s mission and learn:\u003cbr\u003e–The algorithms behind best-first and depth-first search, iterative deepening, parallelizing, binary search, and more\u003cbr\u003e–Basic computational concepts like strings, arrays, stacks, and queues\u003cbr\u003e–How to adapt search algorithms to unusual data structures\u003cbr\u003e–The most efficient algorithms to use in a given situation, and when to apply common-sense heuristic methodsAcknowledgments\u003cbr\u003eA Note to Readers\u003cbr\u003eChapter 1: Search Problems\u003cbr\u003eChapter 2: Exhaustive Search for an Informant\u003cbr\u003eChapter 3: Arrays and Indexes on a Criminal's Farm\u003cbr\u003eChapter 4: Strings and Hidden Messages\u003cbr\u003eChapter 5: Binary Search for a Smuggler's Ship\u003cbr\u003eChapter 6: Binary Search for Clues\u003cbr\u003eChapter 7: Adapting Algorithms for a Daring Escape\u003cbr\u003eChapter 8: Socks: An Interlude and an Introduction\u003cbr\u003eChapter 9: Backtracking to Keep the Search Going\u003cbr\u003eChapter 10: Picking Locks with Breadth-First Search\u003cbr\u003eChapter 11: Depth-First Search in an Abandoned Prison\u003cbr\u003eChapter 12: Cafeteria Stacks and Queues\u003cbr\u003eChapter 13: Stacks and Queues for Search\u003cbr\u003eChapter 14: Let's Split Up: Parallelized Search\u003cbr\u003eChapter 15: Iterative Deepening Can Save Your Life\u003cbr\u003eChapter 16: Inverted Indexes: The Search Narrows\u003cbr\u003eChapter 17: A Binary Search Tree Trap\u003cbr\u003eChapter 18: Building Binary Search Ladders\u003cbr\u003eChapter 19: Binary Search Trees for Suspects\u003cbr\u003eChapter 20: Adding Suspects to the Search Tree\u003cbr\u003eChapter 21: The Binary Search Tree Property\u003cbr\u003eChapter 22: Tries for Paperwork\u003cbr\u003eChapter 23: Best-First Search: A Detective's Most Trusted Tool\u003cbr\u003eChapter 24: Priority Queues for Investigations\u003cbr\u003eChapter 25: Priority Queues for Lock Picking\u003cbr\u003eChapter 26: Heuristics in Search\u003cbr\u003eChapter 27: Heaps in Politics and Academia\u003cbr\u003eChapter 28: Difficult Search Problems\u003cbr\u003eChapter 29: Search Termination\u003cbr\u003eEpilogue“This book is both entertaining and educational, and a great stocking stuffer, especially for anyone involved with data analysis.”\u003cbr\u003e\u003cb\u003e—The Vancouver Sun\u003cbr\u003e\u003c\/b\u003e\u003cbr\u003e“A great introduction for older kids or adults to the concepts contained therein. The story is filled with humor and adventure.”\u003cbr\u003e\u003cb\u003e—Geek Dad\u003cbr\u003e\u003c\/b\u003e\u003cbr\u003e“Exceptionally well written, organized and presented...truly adds an entertaining and novel twist to making the learning algorithms fun, practical, and effective.”\u003cbr\u003e\u003cb\u003e—Midwest Book Review\u003cbr\u003e\u003c\/b\u003e\u003cbr\u003e“I love being able to wrap learning into this story and that it doesn’t seem like learning at all. This book is perfect for computer science students or amateur sleuths who enjoy a good mystery.”\u003cbr\u003e\u003cb\u003e—The Old Schoolhouse\u003cbr\u003e\u003c\/b\u003e\u003cbr\u003e“I give this book 10 out of 10 horseshoes.”\u003cbr\u003e\u003cb\u003e—CodeRanch\u003cbr\u003e\u003c\/b\u003e\u003cbr\u003e“Good wizards and evil wizards cast spells, which helps capture the interest of students in the upper middle and lower high school grades...The story is worth the time to learn about different binary searches.”\u003cbr\u003e\u003cb\u003e—National Council of Teachers of Mathematics\u003cbr\u003e\u003c\/b\u003e\u003cbr\u003e“I think the book would be good for high school–college level students interested in search algorithms or computer science in general. I enjoyed the book and the refresher on CS topics.”\u003cbr\u003e\u003cb\u003e—404 Tech Support\u003cbr\u003e\u003c\/b\u003e\u003cb\u003eJeremy Kubica\u003c\/b\u003e is a principal engineer at Google working on machine learning and algorithms. He has a PhD in robotics from Carnegie Mellon University and a BS in computer science from Cornell University. Kubica is the author of the popular Computational Fairy Tales blog.","brand":"No Starch Press","offers":[{"title":"Default Title","offer_id":46304020070629,"sku":"NP9781593277499","price":19.99,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/1842\/7735\/files\/9781593277499.jpg?v=1767738884","url":"https:\/\/k12savings.com\/products\/the-cs-detective-isbn-9781593277499","provider":"K12savings","version":"1.0","type":"link"}