仅支持付费会员使用
微信扫码开通付费会员
Everyday Data Structures
William Smith
微信读书推荐值 0%
待评分
0人点评
推荐
一般
不行
推荐(0)
一般(0)
不行(0)
阅读
33人
体验卡可读
字数
42.1万字
微信读书推荐值 0%
待评分
0人点评
推荐
一般
不行
推荐(0)
一般(0)
不行(0)
阅读
33人
体验卡可读
字数
42.1万字
Everyday Data StructuresWilliam Smith
If you're self-taught programmers in any language who wants to gain a solid understanding of data structures and how to use them to solve real-world problems in your day-to-day development work, then this book is for you.
If you're self-taught programmers in any language who wants to gain a solid understanding of data structures and how to use them to solve real-world problems in your day-to-day development work, then this book is for you.
简介
If you're self-taught programmers in any language who wants to gain a solid understanding of data structures and how to use them to solve real-world problems in your day-to-day development work, then this book is for you.
版权
出版社Packt Publishing
出版时间2017年3月
字数421,424
分类计算机-编程设计
试读结束
本书为免费体验卡可读
登录后获得专属福利 · 百万好书免费读
热门想法
复制
划线
写想法
查询
书友想法
评论
赞
0
暂无评论
发 表
回复
赞
评论详情
发 表
写想法
公开
确定删除吗？
取 消
删 除
想法 · 0
写想法
书友想法
评论
0
赞
0
暂无评论
发 表
回复
赞
评论详情
发 表
写想法
公开
查询
继续提问
Generated by AI
写想法
公开
字号大小
字体
翻译完成
切 换
译文
目录
Ai 问书
笔记
开启书友想法
上下滚动阅读
字号
浅色
Everyday Data Structures
William Smith
- 扉页
- 版权信息+书签
- Credits
- About the Author
- About the Reviewer
- www.PacktPub.com
- Customer Feedback
- Preface
- Chapter 1. Data Types: Foundational Structures
- Numeric data types
- Boolean data type
- Strings
- Summary
- Chapter 2. Arrays: Foundational Collections
- Mutable versus immutable arrays
- Advanced topics
- Summary
- Chapter 3. Lists: Linear Collections
- List implementations
- Instantiating lists
- Revisiting users logged in to a service
- Doubly linked list
- Searching
- A few pointers
- Summary
- Chapter 4. Stacks: LIFO Collections
- Initializing stacks
- Case study: motion planning algorithm
- Advanced topics - stack implementations
- Summary
- Chapter 5. Queues: FIFO Collections
- Initializing queues
- Case study: customer service
- Advanced topics
- Summary
- Chapter 6. Dictionaries: Keyed Collections
- Initializing dictionaries
- Case study: arcade ticket totals
- Advanced topics
- Summary
- Chapter 7. Sets: No Duplicates
- Set theory
- Initializing sets
- Example: revisiting users logged in to a service
- Case-study: music playlists
- Advanced topics
- Summary
- Chapter 8. Structs: Complex Types
- The essentials
- Enums
- Summary
- Chapter 9. Trees: Non-Linear Structures
- Tree data structure versus tree data type
- Tree terminology
- Common operations
- Instantiating trees
- Tree structures
- Recursion
- Traversal
- Summary
- Chapter 10. Heaps: Ordered Trees
- Heap implementations
- Heap operations
- Instantiating heaps
- Min heap structure
- Common applications
- Summary
- Chapter 11. Graphs: Values with Relationships
- Visual graph concepts
- Graph operations
- Graph implementations
- The graph data structure
- Summary
- Chapter 12. Sorting: Bringing Order Out Of Chaos
- Selection sort
- Insertion sort
- Bubble sort
- Quick sort
- Merge sort
- Bucket sort
- Summary
- Chapter 13. Searching: Finding What You Need
- Linear search
- Binary search
- Jump search
- Summary
Everyday Data Structures
已读到0% · 共0条笔记
你可以在这里记录本书的
想法、划线、书签
想法、划线、书签
点评此书
点评此书
推荐
一般
不行
公开
书友想法
评论
0
赞
0
暂无评论
发 表
回复
赞
评论详情
发 表
确定删除吗？
取 消
删 除
《Everyday Data Structures》
仅支持付费会员使用
仅支持付费会员使用
微信扫码开通付费会员