Grokking.Algorithms.1617292230
Grokking Algorithms is a fully illustrated, friendly guide that teaches you how to apply common algorithms to the practical problems you face every day as a programmer. You'll start with sorting and searching and, as you build up your skills in thinking algorithmically, you'll tackle more complex concerns such as data compression and artificial intelligence. Each carefully presented example includes helpful diagrams and fully annotated code samples in Python.
Grokking Algorithms is a friendly take on this core computer science topic. In it, you'll learn how to apply common algorithms to the practical programming problems you face every day. You'll start with tasks like sorting and searching. As you build up your skills, you'll tackle more complex problems like data compression and artificial intelligence. Each carefully presented example includes helpful diagrams and fully annotated code samples in Python. By the end of this book, you will have mastered widely applicable algorithms as well as how and when to use them.
Table of Contents
Chapter 1. Introduction to algorithms
Chapter 2. Selection sort
Chapter 3. Recursion
Chapter 4. Quicksort
Chapter 5. Hash tables
Chapter 6. Breadth-first search
Chapter 7. Dijkstra’s algorithm
Chapter 8. Greedy algorithms
Chapter 9. Dynamic programming
Chapter 10. K-nearest neighbors
代码片段和文件信息
属性 大小 日期 时间 名称
----------- --------- ---------- ----- ----
文件 26021262 2018-09-04 01:50 Manning.Grokking.Algorithms.An.illustrated.guide.for.programmers.and.other.curious.people.1617292230.pdf
----------- --------- ---------- ----- ----
文件 26021262 2018-09-04 01:50 Manning.Grokking.Algorithms.An.illustrated.guide.for.programmers.and.other.curious.people.1617292230.pdf
版权声明:本文内容由互联网用户自发贡献,该文观点仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容, 请发送邮件举报,一经查实,本站将立刻删除。
评论列表(条)