Category: Blog
-
How to Learn Bresenham’s Line Algorithm: Integer Error Terms, Octants, Rasterization and Robust Grid Traversal
A Learning Hall guide to Bresenham’s line algorithm from midpoint geometry and integer error terms through all-octant rasterization, edge cases and robust grid traversal.
-
How to Learn Push–Relabel Maximum Flow: Preflows, Excess, Height Labels, Discharge and Global Relabeling
A Learning Hall guide to push–relabel maximum flow from preflow and excess through height labels, discharge, heuristics, correctness and production implementation.
-
How to Learn Hopscotch Hashing: Neighborhoods, Displacement, Bitmaps, Load Factors and Concurrent Table Design
A Learning Hall guide to hopscotch hashing from neighbourhood intuition through bitmaps, legal displacement, insertion failure, locality and concurrent table design.
-
How to Learn Scapegoat Trees: α-Balance, Rebuilding, Size Bounds and Amortized Search-Tree Updates
A Learning Hall guide to scapegoat trees from beginner BST intuition through α-balance, scapegoat discovery, subtree rebuilding, deletion rules and amortized analysis.
-
How to Learn Compensated Summation: Kahan, Neumaier, Floating-Point Error and Reproducible Reductions
A Learning Hall guide to accurate floating-point summation from non-associativity and rounding through Kahan and Neumaier compensation, conditioning, parallelism and reproducible reductions.
-
How to Learn B+ Trees: Fanout, Leaf Links, Page Splits, Merges and Database Index Engineering
A Learning Hall guide to B+ trees from beginner search and insertion through page splits, leaf links, fanout, bulk loading, concurrency and professional database index engineering.
