Bild 1 von 1

Standardbild

Jeremy Kubica The CS Detective (Taschenbuch) - Bild 1 von 1

The Cs Detective von Jeremy Kubica (2016, Taschenbuch)

Rarewaves Outlet (1394776)

98,1% positive Bewertungen

Preis:

€ 19,59

(inkl. MwSt.)

Kostenloser Versand

Lieferung ca. Di, 1. Jul - Mi, 9. Jul

Rücknahme:

30 Tage Rückgabe. Käufer zahlt Rückversand. Wenn Sie ein eBay-Versandetikett verwenden, werden die Kosten dafür von Ihrer Rückerstattung abgezogen.

Artikelzustand:

Neu

Autor: Jeremy Kubica. Produktart: Taschenbuch. Disgraced ex-detective. Search expert. In this detective story, you ll learn how to use algorithmic tools to solve the case. Each chapter introduces a thrilling twist matched with a new algorithmic concept, ending with a technical recap.

Sammeln Sie 20 Punkte | Mehr erfahrenzu eBay Plus-Punkten - wird in neuem Fenster oder Tab geöffnet

Über dieses Produkt

Produktinformation

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