OFFRE LISEUSES
Une liseuse achetée = une housse offerte* jusqu'au 21 juin
The CS Detective. An Algorithmic Tale of Crime, Conspiracy, and Computation
Par :Formats :
Disponible dans votre compte client Decitre ou Furet du Nord dès validation de votre commande. Le format ePub est :
- Compatible avec une lecture sur My Vivlio (smartphone, tablette, ordinateur)
- Compatible avec une lecture sur liseuses Vivlio
- Pour les liseuses autres que Vivlio, vous devez utiliser le logiciel Adobe Digital Edition. Non compatible avec la lecture sur les liseuses Kindle, Remarkable et Sony
, qui est-ce ?Notre partenaire de plateforme de lecture numérique où vous retrouverez l'ensemble de vos ebooks gratuitement
Pour en savoir plus sur nos ebooks, consultez notre aide en ligne ici
- Nombre de pages256
- FormatePub
- ISBN978-1-59327-787-1
- EAN9781593277871
- Date de parution16/08/2016
- Protection num.pas de protection
- Taille8 Mo
- Infos supplémentairesepub
- ÉditeurNo Starch Press
Résumé
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 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
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





