内容简介:Authors have earnedearning
Programming Algorithms
Free!
Minimum price
$9.99
Suggested price
-
364
Pages
-
100,732
Words
-
English
-
PDF
-
EPUB
-
MOBI
-
WEB
Last updated on 2020-04-15
About the Book
http://lisp-univ-etc.blogspot.com/2020/04/programming-algorithms-book-freely.html
-
Share this book
-
Feedback
Email the Author(s)
About the Author
Hi, I'm Vsevolod Dyomkin (or Domkin according to the passport) from Kyiv, Ukraine.
I'm a Lisp programmer and enthusiast, a Natural Language Processing researcher, an occasional writer/blogger, and a teacher.
You can find some more relevant information at http://vseloved.github.io/
Table of Contents
-
- Introduction
- Why Algorithms Matter
- A Few Words about Lisp
- Algorithmic Complexity
- A Crash Course in Lisp
- The Core of Lisp
- A Code Example
- The REPL
- Basic Expressions
- Sequential Execution
- Branching
- Looping
- Procedures and Variables
- Comments
- Getting Started
- Introduction
- Essential Data Structures
- 1 Data Structures
- Data Structures vs Algorithms
- The Data Structure Concept
- Contiguous and Linked Data Structures
- Tuples
- Passing Data Structures in Function Calls
- Structs in Action: Union-Find
- Take-Aways
- 2 Arrays
- Arrays as Sequences
- Dynamic Vectors
- Why Are Arrays Indexed from 0
- Multi-Dimensional Arrays
- Binary Search
- Binary Search in Action: a Fast Specialized In-Memory DB
- Sorting
- O(n^2) Sorting
- Quicksort
- Production Sort
- Performance Benchmark
- Take-Aways
- 3 Linked Lists
- Lists as Sequences
- Lists as Functional Data Structures
- Different Kinds of Lists
- FIFO & LIFO
- Queue
- Stack
- Deque
- Stacks in Action: SAX Parsing
- Lists as Sets
- Merge Sort
- Parallelization of Merge Sort
- Lists and Lisp
- Take-Aways
- 4 Key-Values
- Concrete Key-values
- Simple Arrays
- Associative Lists
- Hash-Tables
- Structs
- Trees
- Operations
- Memoization
- Memoization in Action: Transposition Tables
- Cache Invalidation
- Second Chance and Clock Algorithms
- LFU
- LRU
- Low-Level Caching
- Take-Aways
- Concrete Key-values
- 1 Data Structures
- Derivative Data Structures
- 5 Hash-Tables
- Implementation
- Dealing with Collisions
- Hash-Code
- Advanced Hashing Techniques
- Hash-Functions
- Operations
- Initialization
- Access
- Iteration
- Perfect Hashing
- Implementation
- The CHM92 Algorithm
- Distributed Hash-Tables
- Hashing in Action: Content Addressing
- Take-Aways
- Implementation
- 6 Trees
- Implementation Variants
- Tree Traversal
- Binary Search Trees
- Splay Trees
- Complexity Analysis
- Red-Black and AVL Trees
- B-Trees
- Heaps
- Tries
- Trees in Action: Efficient Mapping
- Take-Aways
- 7 Graphs
- Graph Representations
- Topological Sort
- MST
- Prim’s Algorithm
- Kruskal’s Algorithm
- Pathfinding
- Dijkstra’s Algorithm
- A* Algorithm
- Maximum Flow
- Graphs in Action: PageRank
- Implementation
- Take-Aways
- 8 Strings
- Basic String-Related Optimizations
- Strings in the Editor
- Substring Search
- Knuth-Morris-Pratt (KMP)
- Boyer-Moore (BM)
- Rabin-Karp (RK)
- Aho-Corasick (AC)
- Regular Expressions
- Implementation of the Thompson’s Construction
- Grammars
- String Search in Action: Plagiarism Detection
- Take-aways
- 5 Hash-Tables
- Selected Algorithms
- 9 Dynamic Programming
- Fibonacci Numbers
- String Segmentation
- Text Justification
- Pathfinding Revisited
- LCS and Diff
- DP in Action: Backprop
- Take-aways
- 10 Approximation
- Combinatorial Optimization
- Local Search
- Evolutionary Algorithms
- Branch & Bound
- Gradient Descent
- Improving GD
- Sampling
- Matrix Factorization
- Singular Value Decomposition
- Fourier Transform
- Fourier Transform in Action: JPEG
- Take-Aways
- 11 Compression
- Encoding
- Base64
- Lossless Compression
- Huffman Coding
- Huffman Coding in Action: Dictionary Optimization
- Arithmetic Coding
- DEFLATE
- Take-Aways
- 12 Synchronization
- Synchronization Troubles
- Low-Level Synchronization
- Mutual Exclusion Algorithms
- High-Level Synchronization
- Lock-Free Data Structures
- Data-Parallelism and Message Passing
- STM
- Distributed Computations
- Distributed Algorithms
- Distributed Data Structures
- Distributed Algorithms in Action: Collaborative Editing
- Persistent Data Structures
- Take-Aways
- Afterword
- Acknowledgments
- 9 Dynamic Programming
- Notes
Authors have earned $8,749,440 writing, publishing and selling on Leanpub,
earning 80% royalties while saving up to 25 million pounds of CO2 and up to 46,000 trees .
Learn more about writing on LeanpubThe Leanpub 45-day 100% Happiness Guarantee
Within 45 days of purchase you can get a 100% refund on any Leanpub purchase, in two clicks .
See full terms
Free Updates. DRM Free.
If you buy a Leanpub book, you get free updates for as long as the author updates the book! Many authors use Leanpub to publish their books in-progress, while they are writing them. All readers get free updates, regardless of when they bought the book or how much they paid (including free).
Most Leanpub books are available in PDF (for computers), EPUB (for phones and tablets) and MOBI (for Kindle). The formats that a book includes are shown at the top right corner of this page.
Finally, Leanpub books don't have any DRM copy-protection nonsense, so you can easily read them on any supported device.
Learn more about Leanpub's ebook formats and where to read them
Write and Publish on Leanpub
You can use Leanpub to easily write, publish and sell in-progress and completed ebooks and online courses! Leanpub is a powerful platform for serious authors, combining a simple, elegant writing and publishing workflow with a store focused on selling in-progress ebooks. Leanpub is a magical typewriter for authors: just write in plain text, and to publish your ebook, just click a button. It really is that easy.
以上就是本文的全部内容,希望本文的内容对大家的学习或者工作能带来一定的帮助,也希望大家多多支持 码农网
猜你喜欢:本站部分资源来源于网络,本站转载出于传递更多信息之目的,版权归原作者或者来源机构所有,如转载稿涉及版权问题,请联系我们。
白话机器学习算法
[新加坡] 黄莉婷、[新加坡] 苏川集 / 武传海 / 人民邮电出版社 / 2019-2 / 49.00元
与使用数学语言或计算机编程语言讲解算法的书不同,本书另辟蹊径,用通俗易懂的人类语言以及大量有趣的示例和插图讲解10多种前沿的机器学习算法。内容涵盖k均值聚类、主成分分析、关联规则、社会网络分析等无监督学习算法,以及回归分析、k最近邻、支持向量机、决策树、随机森林、神经网络等监督学习算法,并概述强化学习算法的思想。任何对机器学习和数据科学怀有好奇心的人都可以通过本书构建知识体系。一起来看看 《白话机器学习算法》 这本书的介绍吧!