Category: Blog
-
How to Learn the Schorr–Waite Algorithm: Pointer Reversal, Constant-Space Graph Marking, Restoration and Garbage Collection
A Learning Hall guide to the Schorr–Waite algorithm, from DFS stack elimination and pointer reversal through constant-space graph marking, restoration invariants and garbage-collection context.
-
How to Learn Dijkstra–Scholten Termination Detection: Diffusing Computations, Deficits, Acknowledgements and Global Quiescence
A Learning Hall guide to Dijkstra–Scholten termination detection, from in-flight messages and edge deficits to acknowledgement obligations, engagement trees and global quiescence.
-
How to Learn Pratt Parsing: Binding Power, Prefix/Infix Parselets, Precedence, Associativity and Expression Parsers
A Learning Hall guide to Pratt parsing, from binding power and prefix/infix parselets through associativity, AST construction, diagnostics and professional expression-parser design.
-
How to Learn Welford’s Online Algorithm: Running Mean, Stable Variance, One-Pass Updates and Streaming Statistics
A Learning Hall guide to Welford’s online algorithm, from running mean and M2 updates to numerical stability, mergeable streaming statistics and professional testing.
-
Misra–Gries Algorithm | Heavy Hitters Learning Guide
A Learning Hall guide to Misra–Gries, from majority-vote intuition and counter cancellation through deterministic heavy-hitter guarantees, verification, complexity and production streaming trade-offs.
-
How to Learn the Z Algorithm: Prefix Matches, Z-Boxes, Linear-Time String Search and Periodicity
A Learning Hall guide to the Z algorithm, from Z-array meaning and Z-box invariants through linear-time proof, pattern matching, borders, periodicity and professional implementation.
