Programming Algorithms Book - data structures, algorithms, tools, real-world considerations...

About the Book

•  
  • 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
• 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
• 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
  • 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
• 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
• Notes

The 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.

Learn more about writing on Leanpub

Top Books

View All

Top Bundles

View All