Category: Blog
-
How to Learn Eytzinger Search Layout: Breadth-First Binary Trees, Index Arithmetic, Branch Prediction, Prefetching and Cache-Aware Search
A beginner-to-professional guide to Eytzinger search layout covering breadth-first binary search trees, index arithmetic, lower_bound correctness, branch prediction, prefetching, caches and benchmarking.
-
How to Learn de Casteljau’s Algorithm: Linear Interpolation, Bézier Evaluation, Subdivision, Tangents and Robust Curve Geometry
A beginner-to-professional guide to de Casteljau’s algorithm covering linear interpolation, Bézier evaluation, exact subdivision, tangents, surfaces, rational curves, adaptive tessellation and robust geometry.
-
How to Learn Bitap (Shift-Or): Pattern Bitmasks, Word-Level Automata, Exact Matching and Approximate Search
A beginner-to-professional guide to Bitap/Shift-Or covering pattern bitmasks, word-level automata, exact and approximate matching, Unicode, multiword state, testing and performance.
-
How to Learn Delta-Stepping: Distance Buckets, Light and Heavy Edges, Relaxation Rounds and Parallel Shortest Paths
A beginner-to-professional guide to Delta-Stepping covering distance buckets, light and heavy edges, repeated relaxation, Δ tuning, parallel shortest paths, correctness, testing and production performance.
-
How to Learn Raft Consensus: Terms, Elections, Replicated Logs, Commit Rules and Production Distributed Systems
A beginner-to-professional guide to Raft consensus covering terms, elections, replicated logs, commitment rules, crash recovery, snapshots, membership changes, deterministic testing and production engineering.
-
How to Learn the Thomas Algorithm: Tridiagonal Systems, Forward Elimination, Back Substitution and Numerical Stability
A beginner-to-professional guide to the Thomas algorithm covering tridiagonal structure, forward elimination, back substitution, O(n) complexity, pivoting, stability, PDE applications and production solver choices.
