Once Upon an Algorithm: How Stories Explain Computing (MIT Press) | Computer Science Distilled: Learn the Art of Solving Computational Problems | Grokking Algorithms | Computational Fairy Tales | Best Practices of Spell Design | Lauren Ipsum | Hello Ruby
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 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
Pricing is shown for items sent to or within the U.S., excluding shipping and tax. Please consult the store to determine exact fees. No warranties are made express or implied about the accuracy, timeliness, merit, or value of the information provided. Information subject to change without notice. isbn.nu is not a bookseller, just an information source.