Category: Blog
-
Link–Cut Trees | Dynamic Forests Learning Guide
A Learning Hall guide to link–cut trees, from represented versus auxiliary forests and preferred paths through access, makeroot, dynamic link/cut, path aggregates, amortized analysis and production verification.
-
How to Learn Seam Carving: Energy Maps, Dynamic Programming, Minimal Seams and Content-Aware Resizing
A Learning Hall guide to seam carving, from energy maps and dynamic-programming seams through backtracking, insertion, masks, forward energy, artifacts and professional image-retargeting validation.
-
How to Learn Duval’s Algorithm: Lyndon Words, Factorization, Three Pointers and Linear-Time String Structure
A Learning Hall guide to Duval’s algorithm, from Lyndon words and unique factorization through the i/j/k invariant, linear-time reasoning, minimal rotation and production string-order concerns.
-
How to Learn Fortune’s Algorithm: Voronoi Diagrams, Beach Lines, Site/Circle Events and Robust Sweep Geometry
A Learning Hall guide to Fortune’s algorithm, from Voronoi geometry and parabolic beach lines through site/circle events, robust predicates, topology and professional implementation.
-
How to Learn the Auction Algorithm: Bids, Prices, ε-Complementary Slackness, Scaling and Parallel Assignment
A Learning Hall guide to the auction algorithm, from market-style bidding and price updates through epsilon-complementary slackness, scaling, parallel assignment and production solver choices.
-
How to Learn Modern Timsort and Powersort: Natural Runs, Stable Merging, Galloping and Adaptive Merge Scheduling
A Learning Hall guide to modern Timsort and Powersort, from natural runs and stable merging through galloping, merge scheduling, adaptivity, verification and current CPython behavior.
