Data Structures the Fun Way: An Amusing Adventure with Coffee-Filled Examples

Learn how and when to use the right data structures in any situation, strengthening your computational thinking, problem-solving, and programming skills in the process.

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 endeavor. You'll learn how to work with more than 15 key data structures, from stacks, queues, and caches to bloom filters, skip lists, and graphs. You'll also master linked lists by virtually standing in line at a cafe, hash tables by cataloging 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.

學習如何在任何情況下選擇和使用正確的資料結構，同時加強你的計算思維、問題解決和程式設計技能。

這本易於理解且有趣的書籍通過資料結構的角度深入介紹了計算思維，這是任何程式設計工作中至關重要的組成部分。你將學習如何使用超過15種關鍵的資料結構，從堆疊、佇列和快取到布隆過濾器、跳躍表和圖形。你還將通過在咖啡館排隊的虛擬體驗來掌握鏈結串列，通過整理夏季奧運會的歷史來掌握雜湊表，通過整理廚櫃來掌握四叉樹，同時熟悉基本的計算機科學概念，如遞迴和運行時間分析。

Jeremy Kubica is an engineer director specializing in artificial intelligence and machine learning. He received a Ph.D. in Robotics from Carnegie Mellon University and a BS in Computer Science from Cornell University. He spent his graduate school years creating algorithms to detect killer asteroids (actually stopping them was, of course, left as "future work"). He is the author of multiple books designed to introduce people to computer science, including Computational Fairy Tales and The CS Detective, as well as the Computational Fairy Tales Blog.

Jeremy Kubica是一位專攻人工智慧和機器學習的工程總監。他在卡內基梅隆大學獲得機器人學博士學位，並在康奈爾大學獲得計算機科學學士學位。他在研究生期間致力於開發用於檢測殺手級小行星的演算法（當然，阻止它們是「未來的工作」）。他是多本旨在介紹計算機科學的書籍的作者，包括《計算機童話故事》和《計算機科學偵探》，以及《計算機童話故事博客》。