Category: Blog
-
How to Learn Barnes–Hut: Quadtrees, Octrees, Opening Angles, Force Approximation and O(N log N) N-Body Simulation
A Learning Hall guide to Barnes–Hut, from direct N-body forces and quadtrees/octrees through opening angles, approximation error, integration, validation and professional simulation engineering.
-
How to Learn Jump Point Search: Grid Symmetry Pruning, Forced Neighbours, Jump Points and Optimal A* Acceleration
A Learning Hall guide to Jump Point Search, from A* and grid symmetry through forced neighbours, jump points, optimality, implementation, benchmarking and professional pathfinding practice.
-
How to Learn Rollback DSU: Reversible Union-Find, Offline Dynamic Connectivity and Time-Segment Recursion
A Learning Hall guide to rollback DSU: make union-find reversible, preserve union-by-size, process edge lifetimes offline, and solve dynamic connectivity through segment-tree-over-time recursion.
-
How to Learn MinHash: Jaccard Similarity, Random Permutations, Signatures and Locality-Sensitive Hashing
A Learning Hall guide to MinHash: understand Jaccard similarity, why minimum hashes estimate set overlap, how signatures reduce comparison cost, and how LSH turns similarity estimation into candidate retrieval.
-
How to Learn Heavy-Hitter Algorithms: Misra–Gries, Space-Saving, Error Bounds and Streaming Frequency
A Learning Hall guide to heavy-hitter algorithms: understand Misra–Gries counters, Space-Saving replacement, deterministic error bounds and how streaming systems find frequent items without storing every frequency.
-
How to Learn Cuckoo and Quotient Filters: Fingerprints, Relocation, Deletion and Approximate Membership
A Learning Hall guide to modern approximate-membership filters: understand fingerprints, cuckoo relocation, quotient–remainder addressing, deletion, false positives and workload trade-offs.
