Description
Book SynopsisThis 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.
Trade Review"The perfect book for novice programmers as well as developers who want to improve their knowledge of key software concepts."
—Ben Dickson, TechTalks"Clear and fun to someone learning the topics for the first time. . . . overall a great read."
—Jeanne Boyarsky, CodeRanch
"A good book to read from beginning to end . . . a nice quick reference for reading about data structures, the complexity of each one, and for what is useful or not!"
—Eduardo Blázquez, @Farenain, COSEC Lab at Charles III University of Madrid"Good overview of data structures, intuitive with good visualizations."
—Lucille E Nguyen, Computational Social Scientist
"A fun intro to the topic for self-taught programmers and data scientists."
—Crow IntelligenceTable of ContentsIntroductionChapter 1: Information in Memory
Chapter 2: Binary Search
Chapter 3: Dynamic Data Structures
Chapter 4: Stacks and Queues
Chapter 5: Binary Search Trees
Chapter 6: Tries and Adapting Data Structures
Chapter 7: Priority Queues and Heaps
Chapter 8: Grids
Chapter 9: Spatial Trees
Chapter 10: Hash Tables
Chapter 11: Caches
Chapter 12: B-Trees
Chapter 13: Bloom Filters
Chapter 14: Skip Lists
Chapter 15: Graphs
Conclusion
