Jeremy Kubica – författare

This accessible and entertaining book provides an in-depth introduction to computational thinking through the lens of data structures a critical component in any programming endeavour. You'll learn how to work with more than 15 key data structures, from arrays, stacks, and queues, to caches, bloom filters, skip lists, and graphs. You'll also master linked lists by virtually standing in line at a cafe, hash tables by cataloguing the history of the summer Olympics, and QuadTrees by neatly organizing your kitchen cabinets, all while becoming familiar with basic computer science concepts, like recursion and running time analysis.

This book provides a fun and accessible introduction to graph algorithms, commonly used to solve a wide range of computational and mathematical problems. Full of humorous analogies, detailed diagrams, and real-world examples using the Python programming language, Graph Algorithms the Fun Way will show you how graph data structures can model a vast variety of phenomena - from physical mazes to communication networks - while helping you develop a strong foundation for how they work, when to use them, and how to create variants. It starts with the structure of graphs, demonstrating the ways they can represent connections between nodes, such as the best route through a city or how rumours spread in a social network. Each subsequent chapter introduces new graph algorithms along with their underlying concepts and applications - from basic searches to more advanced methods of exploring graphs. You'll have a blast solving brain-teasers including the 15-square puzzle, matching adopted pets with homes, calculating the maximum flow of a sewage network, traversing magical labyrinths, sorting recipe steps to craft the perfect cookies, and more. You'll also learn how to: Work with weighted and directed graphs, Use heuristics to prioritize which paths in a graph to explore, Determine which components of a graph are key for its structural integrity, Generate random mazes. Guided by the bestselling author of Data Structures the Fun Way, this equally fun follow-up will help you build a strong understanding of a crucial coding topic and apply graph algorithms to your own projects.

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.

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